1. On Distance Antimagic Labeling of Some Product Graphs.
- Author
-
Yadav, Anjali and Minirani S.
- Abstract
In graph theory, graph labeling is an essential area of study because labeled graphs offer useful mathematical models for coding theory, cryptography, astronomy, radar, database administration and communication networks. Consider a bijection for a graph G of order n, f : V (G) → {1, 2, ..., n}. The weight of a vertex z of G, expressed as w(z), is defined as the sum of labels assigned to all vertices adjacent to vertex z in G. If the weights are distinct for every unique pair of vertices y, z in V (G), then the labeling f is referred to as distance antimagic. A distance antimagic graph is any graph G that accepts such a labeling. Distance antimagic labeling on various basic graph products are discussed in this paper. We explore results on (a, d)-distance antimagic labeling for the lexicographic product G * H and distance antimagic labeling for the cartesian product G * H, tensor product G x H and strong product G x H in this work, where the graphs G and H are cycle related graphs, paths or complete graphs. Also, computer-aided algorithms are designed to verify that vertex weights are distinct. [ABSTRACT FROM AUTHOR]
- Published
- 2024