IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/504251.html
   My bibliography  Save this article

Tree-Antimagicness of Disconnected Graphs

Author

Listed:
  • Martin Bača
  • Zuzana Kimáková
  • Andrea Semaničová-Feňovčíková
  • Muhammad Awais Umar

Abstract

A simple graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . The graph is said to be ( , )- -antimagic if there exists a bijection from the vertex set and the edge set onto the set of integers such that, for all subgraphs of isomorphic to , the sum of labels of all vertices and edges belonging to constitute the arithmetic progression with the initial term and the common difference . is said to be a super ( , )- -antimagic if the smallest possible labels appear on the vertices. In this paper, we study super tree-antimagic total labelings of disjoint union of graphs.

Suggested Citation

  • Martin Bača & Zuzana Kimáková & Andrea Semaničová-Feňovčíková & Muhammad Awais Umar, 2015. "Tree-Antimagicness of Disconnected Graphs," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-4, January.
    • Handle: RePEc:hin:jnlmpe:504251
    DOI: 10.1155/2015/504251
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/504251.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2015/504251.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/504251?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:504251. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.