Tree-Antimagicness of Web Graphs and Their Disjoint Union

Zhijun Zhang, Muhammad Awais Umar, Xiaojun Ren, Basharat Rehman Ali, Mujtaba Hussain and Xiangmei Li

Mathematical Problems in Engineering, 2020, vol. 2020, 1-6

Abstract:

In graph theory, the graph labeling is the assignment of labels (represented by integers) to edges and/or vertices of a graph. For a graph , with vertex set and edge set , a function from to a set of labels is called a vertex labeling of a graph, and the graph with such a function defined is called a vertex-labeled graph. Similarly, an edge labeling is a function of to a set of labels, and in this case, the graph is called an edge-labeled graph. In this research article, we focused on studying super - -antimagic labeling of web graphs and isomorphic copies of their disjoint union.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/4565829.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/4565829.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:4565829

DOI: 10.1155/2020/4565829

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().