All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On H-antimagicness of disconnected graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F16%3A43931171" target="_blank" >RIV/49777513:23520/16:43931171 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1017/S0004972716000204" target="_blank" >http://dx.doi.org/10.1017/S0004972716000204</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1017/S0004972716000204" target="_blank" >10.1017/S0004972716000204</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On H-antimagicness of disconnected graphs

  • Original language description

    A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. An (a, d)-H-antimagic total labeling of a graph G admitting an H-covering is a bijective function from the vertex set V(G) and the edge set E(G) of the graph G onto the set of integers {1, 2, . . . , |V (G)| + |E(G)|} such that for all subgraphs H' isomorphic to H, the sum of labels of all the edges and vertices belonging to H' constitute the arithmetic progression with the initial term a and the common difference d. Such a labeling is called super if the smallest possible labels appear on the vertices. In this paper, we study super (a,d)-H-antimagic labellings of a disjoint union of graphs for d=|E(H)|MINUS SIGN |V(H)|

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Bulletin of the Australian Mathematical Society

  • ISSN

    0004-9727

  • e-ISSN

  • Volume of the periodical

    94

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    7

  • Pages from-to

    201-207

  • UT code for WoS article

    000384280400004

  • EID of the result in the Scopus database

    2-s2.0-84962128019