RADIO AND RADIO ANTIPODAL LABELINGS FOR CIRCULANT GRAPHS G(4k + 2; {1, 2})

Topological indices and polynomials are predicting properties like boiling points, fracture toughness, heat of formation, etc., of different materials, and thus save us from extra experimental burden. In this article we compute many topological indices for the family of circulant graphs. At first, we give a general closed form of M-polynomial of this family and recover many degree-based topological indices out of it. We also compute Zagreb indices and Zagreb polynomials of this family. Our results extend many existing results.

show abstract

“…computed the revised Szeged spectrum of circulant graphs [28]. Multi-level and antipodal labelings for circulant graphs is discussed in [29,30].…”

Section: Graphmentioning

confidence: 99%

Some Invariants of Circulant Graphs

et al. 2016

Self Cite

View full text Add to dashboard Cite

show abstract

“…Graph labeling has been used in many applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, communication network addressing, and data base management [10][11][12]. In the present article, we have studied super T (4,2) -antimagic labeling of web graphs W(2, n) for differences d ∈ 0, 1, .…”

Section: Introductionmentioning

confidence: 99%

Tree-Antimagicness of Web Graphs and Their Disjoint Union

Zhang

Umar²,

Ren

et al. 2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

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.

show abstract

“…Classes of graphs that are circulant include the, antiprism graphs, crown graphs, cocktail party graphs, rook graphs, complete bipartite graphs, Andrásfai graphs, empty graphs, complete graphs, Paley graphs of prime order, Möbius ladders, torus grid graphs, and prism graphs. Because of this somewhat universality, circulant graphs have been the subject of much investigation; for example, the chromatic index, Connectivity, Wiener index, domination number, revised Szeged spectrum, Multi-level and antipodal labeling, M polynomial and many degree-based topological indices for circulant graphs are studied (Voigt and Walther, 1991;Boesch, and Tindell, 1984;Zhou, 2014;Xueliang et al, 2011;Habibi and Ashrafi, 2014;Kang et al, 2016;Nazeer et al, 2015;Munir et al, 2016). For details on topological indices readers are refered to Sardar et al (2017) and Rehman et al (2017).…”

Section: Introductionmentioning

confidence: 99%

K Banhatti and K hyper Banhatti indices of circulant graphs

Asghar¹,

Rafaqat²,

Nazeer³

et al. 2018

Int. j. adv. appl. sci.

Self Cite

View full text Add to dashboard Cite

A topological index is a numerical number associated with a graph that describes its topology. History traces a long path on the study of topological indices. A circulant graph is one of the most comprehensive families, as its specializations give some important families like complete graphs, crown graphs, rook graphs, complete bipartite graphs, cocktail party graphs, empty graphs, etc. The aim of this report is to compute the first and second K Banhatti indices of circulant graph. We also compute the first and second K hyper Banhatti indices of this family of graph. Moreover, we plot our results to see the dependences of the first and second K Banhatti indices and the first and second K hyper Banhatti indices on the involved parameters.

show abstract

RADIO AND RADIO ANTIPODAL LABELINGS FOR CIRCULANT GRAPHS G(4k + 2; {1, 2})

Cited by 7 publications

References 6 publications

Some Invariants of Circulant Graphs

Some Invariants of Circulant Graphs

Tree-Antimagicness of Web Graphs and Their Disjoint Union

K Banhatti and K hyper Banhatti indices of circulant graphs

Contact Info

Product

Resources

About