Tree-Antimagicness of Web Graphs and Their Disjoint Union
Joint Authors
Umar, Muhammad Awais
Zhang, Zhijun
Ren, Xiaojun
Ali, Basharat Rehman
Hussain, Mujtaba
Li, Xiangmei
Source
Mathematical Problems in Engineering
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-04-09
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
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 G=V,E, with vertex set V and edge set E, a function from V 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 E 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 ad,d-T4,2-antimagic labeling of web graphs W2,n and isomorphic copies of their disjoint union.
American Psychological Association (APA)
Zhang, Zhijun& Umar, Muhammad Awais& Ren, Xiaojun& Ali, Basharat Rehman& Hussain, Mujtaba& Li, Xiangmei. 2020. Tree-Antimagicness of Web Graphs and Their Disjoint Union. Mathematical Problems in Engineering،Vol. 2020, no. 2020, pp.1-6.
https://search.emarefa.net/detail/BIM-1195242
Modern Language Association (MLA)
Zhang, Zhijun…[et al.]. Tree-Antimagicness of Web Graphs and Their Disjoint Union. Mathematical Problems in Engineering No. 2020 (2020), pp.1-6.
https://search.emarefa.net/detail/BIM-1195242
American Medical Association (AMA)
Zhang, Zhijun& Umar, Muhammad Awais& Ren, Xiaojun& Ali, Basharat Rehman& Hussain, Mujtaba& Li, Xiangmei. Tree-Antimagicness of Web Graphs and Their Disjoint Union. Mathematical Problems in Engineering. 2020. Vol. 2020, no. 2020, pp.1-6.
https://search.emarefa.net/detail/BIM-1195242
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1195242