Computing edge weights of magic labeling on rooted products of graphs
type: Item
instance of: scholarly article
title: Computing edge weights of magic labeling on rooted products of graphs
zbMATH Open document ID: 1459.05288
DOI: 10.1155/2020/2160104
author: Jiabao Liu
author: Hafiz Usman Afzal
author: M. Javaid
published in: Mathematical Problems in Engineering
publication date: 2020-10-14T00:00:00Z
review text: Summary: Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications in the fields of civil, software, electrical, and network engineering. For example, in network engineering, any systems interconnected in a network can be converted into a graph and specific numeric labels assigned to the converted graph under certain rules help us in the regulation of data traffic, connectivity, and bandwidth as well as in coding/decoding of signals. Especially, both antimagic and magic graphs serve as models for surveillance or security systems in urban planning. In [SUT J. Math. 34, No. 2, 105--109 (1998; Zbl 0918.05090)], \textit{H. Enomoto} et al. introduced the notion of super \(\left(a, 0\right)\) edge-antimagic labeling of graphs. In this article, we shall compute super \(\left(a, 0\right)\) edge-antimagic labeling of the rooted product of \(P_n\) and the complete bipartite graph \(\left( K_{2, m}\right)\) combined with the union of path, copies of paths, and the star. We shall also compute a super \(\left(a, 0\right)\) edge-antimagic labeling of rooted product of \(P_n\) with a special type of pancyclic graphs. The labeling provided here will also serve as super \(\left( a^\prime, 2\right)\) edge-antimagic labeling of the aforesaid graphs. All the structures discussed in this article are planar. Moreover, our findings have also been illustrated with examples and summarized in the form of a table and \(3D\) plots.
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7260951
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2020/2160104
OpenAlex ID: W3089702487
cites work: On anti-magic labeling for graph products
cites work: Antimagicness of generalized corona and snowflake graphs
cites work: Magic Graphs
cites work: On antimagic labellings of some cycle related graphs
cites work: Formulas and algorithms of antimagic labelings of some helm related graphs
cites work: A Graph Theoretic Approach for Modeling Mobile Robot Team Formations
cites work: Q3999001
cites work: Magic Valuations of Finite Graphs
cites work: Q4717035
cites work: Q4236613
cites work: Super \((a,d)\)-edge antimagic total labeling of a subclass of trees
cites work: On super edge-antimagic total labeling of subdivided stars
cites work: Q4924921
cites work: Q3059041
cites work: On super \((a, d)\)-edge-antimagic total labeling of generalized extended \(w\)-trees.
cites work: On \((a, d)\)-edge-antimagic total labelings of extended w-trees
cites work: Super edge-magic total labeling on w-trees
cites work: Q3561442
cites work: Combinatorial Geometry and Graph Theory
cites work: On super (\(a, d\))-edge-antimagic total labeling of subdivided caterpillar
cites work: Q5461541
cites work: Q4650002
cites work: Q3025216
cites work: A magical approach to some labeling conjectures
cites work: The place of super edge-magic labelings among other classes of labelings
cites work: Q5419833
cites work: Super \((a,d)\)-edge antimagic total labeling of some classes of graphs
cites work: On Super Edge-Magic Strength and Deficiency of Graphs
description: scientific article; zbMATH DE number 7260951