scholarly journals On Topological Indices of Total Graph and Its Line Graph for Kragujevac Tree Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-32
Author(s):  
Salma Kanwal ◽  
Ayesha Riasat ◽  
Muhammad Kamran Siddiqui ◽  
Shabnam Malik ◽  
Khadija Sarwar ◽  
...  

Kragujevac tree is indicated by K ; K ∈ K g q = s 2 t + 1 + 1 , s with order and size s 2 t + 1 + 1 and s 2 t + 1 , respectively. In this paper, we have a look at certain topological features of the total graph and line graph of the total graph of the considered tree, i.e ., Kragujevac tree, by computing different topological indices and polynomials.

Mathematics ◽  
2019 ◽  
Vol 7 (3) ◽  
pp. 283 ◽  
Author(s):  
Jianzhong Xu ◽  
Jia-Bao Liu ◽  
Ahsan Bilal ◽  
Uzma Ahmad ◽  
Hafiz Muhammad Afzal Siddiqui ◽  
...  

Topological indices are numerical values associated with a graph (structure) that can predict many physical, chemical, and pharmacological properties of organic molecules and chemical compounds. The distance degree (DD) index was introduced by Dobrynin and Kochetova in 1994 for characterizing alkanes by an integer. In this paper, we have determined expressions for a DD index of some derived graphs in terms of the parameters of the parent graph. Specifically, we establish expressions for the DD index of a line graph, subdivision graph, vertex-semitotal graph, edge-semitotal graph, total graph, and paraline graph.


2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Salma Kanwal ◽  
Shanshan Shang ◽  
Muhammad Kamran Siddiqui ◽  
Tahira Sumbal Shaikh ◽  
Ammara Afzal ◽  
...  

In this paper, we have taken review of certain topological topological characteristics of subdivision and the line graph of subdivision of Kragujevac tree. A Kragujevac tree is denoted by K , K ∈ Kg q = r 2 t + 1 + 1 , r , with order r 2 t + 1 + 1 and size r 2 t + 1 , respectively. We have computed the Zagreb polynomials, forgotten polynomial, and M-polynomial for Kragujevac tree. Moreover, we have computed topological indices like Zagreb-type indices, reduced reciprocal Randić indices, family of Gourava indices as well as forgotten index. Further, some topological indices that can be directly derived from M-polynomial, i.e., first and second Zagreb index, modified second Zagreb index, Randić and reciprocal Randić index, symmetric division and harmonic index, and inverse sum and augmented Zagreb index are also computed.


2017 ◽  
Vol 1 (1) ◽  
pp. 62-71 ◽  
Author(s):  
Hafiz Mutee ur Rehman ◽  
◽  
Riffat Sardar ◽  
Ali Raza ◽  
◽  
...  

2018 ◽  
Vol 5 (2) ◽  
pp. 11-15
Author(s):  
Aaresh R.R ◽  
Venkatachalam M ◽  
Deepa T

Dynamic coloring of a graph G is a proper coloring. The chromatic number of a graph G is the minimum k such that G has a dynamic coloring with k colors. In this paper we investigate the dynamic chromatic number for the Central graph, Middle graph, Total graph and Line graph of Web graph Wn denoted by C(Wn), M(Wn), T(Wn) and L(Wn) respectively.


2021 ◽  
Vol 27 (2) ◽  
pp. 191-200
Author(s):  
K. Kalaiselvi ◽  
◽  
N. Mohanapriya ◽  
J. Vernold Vivin ◽  
◽  
...  

An r-dynamic coloring of a graph G is a proper coloring of G such that every vertex in V(G) has neighbors in at least $\min\{d(v),r\}$ different color classes. The r-dynamic chromatic number of graph G denoted as $\chi_r (G)$, is the least k such that G has a coloring. In this paper we obtain the r-dynamic chromatic number of the central graph, middle graph, total graph, line graph, para-line graph and sub-division graph of the comb graph $P_n\odot K_1$ denoted by $C(P_n\odot K_1), M(P_n\odot K_1), T(P_n\odot K_1), L(P_n\odot K_1), P(P_n\odot K_1)$ and $S(P_n\odot K_1)$ respectively by finding the upper bound and lower bound for the r-dynamic chromatic number of the Comb graph.


2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Musa Demirci ◽  
Sadik Delen ◽  
Ahmet Sinan Cevik ◽  
Ismail Naci Cangul

A derived graph is a graph obtained from a given graph according to some predetermined rules. Two of the most frequently used derived graphs are the line graph and the total graph. Calculating some properties of a derived graph helps to calculate the same properties of the original graph. For this reason, the relations between a graph and its derived graphs are always welcomed. A recently introduced graph index which also acts as a graph invariant called omega is used to obtain such relations for line and total graphs. As an illustrative exercise, omega values and the number of faces of the line and total graphs of some frequently used graph classes are calculated.


2019 ◽  
Vol 11 (01) ◽  
pp. 1950006 ◽  
Author(s):  
Sourav Mondal ◽  
Nilanjan De ◽  
Anita Pal

Topological indices are numeric quantities that transform chemical structure to real number. Topological indices are used in QSAR/QSPR studies to correlate the bioactivity and physiochemical properties of molecule. In this paper, some newly designed neighborhood degree-based topological indices named as neighborhood Zagreb index ([Formula: see text]), neighborhood version of Forgotten topological index ([Formula: see text]), modified neighborhood version of Forgotten topological index ([Formula: see text]), neighborhood version of second Zagreb index ([Formula: see text]) and neighborhood version of hyper Zagreb index ([Formula: see text]) are obtained for Graphene and line graph of Graphene using subdivision idea. In addition, these indices are compared graphically with respect to their response for Graphene and line graph of subdivision of Graphene.


Symmetry ◽  
2018 ◽  
Vol 10 (9) ◽  
pp. 360 ◽  
Author(s):  
J. Méndez-Bermúdez ◽  
Rosalío Reyes ◽  
José Rodríguez ◽  
José Sigarreta

A graph operator is a mapping F : Γ → Γ ′ , where Γ and Γ ′ are families of graphs. The different kinds of graph operators are an important topic in Discrete Mathematics and its applications. The symmetry of this operations allows us to prove inequalities relating the hyperbolicity constants of a graph G and its graph operators: line graph, Λ ( G ) ; subdivision graph, S ( G ) ; total graph, T ( G ) ; and the operators R ( G ) and Q ( G ) . In particular, we get relationships such as δ ( G ) ≤ δ ( R ( G ) ) ≤ δ ( G ) + 1 / 2 , δ ( Λ ( G ) ) ≤ δ ( Q ( G ) ) ≤ δ ( Λ ( G ) ) + 1 / 2 , δ ( S ( G ) ) ≤ 2 δ ( R ( G ) ) ≤ δ ( S ( G ) ) + 1 and δ ( R ( G ) ) − 1 / 2 ≤ δ ( Λ ( G ) ) ≤ 5 δ ( R ( G ) ) + 5 / 2 for every graph which is not a tree. Moreover, we also derive some inequalities for the Gromov product and the Gromov product restricted to vertices.


Mathematics ◽  
2019 ◽  
Vol 7 (4) ◽  
pp. 366 ◽  
Author(s):  
Jia-Bao Liu ◽  
Bahadur Ali ◽  
Muhammad Aslam Malik ◽  
Hafiz Muhammad Afzal Siddiqui ◽  
Muhammad Imran

A topological index is a numeric quantity that is closely related to the chemical constitution to establish the correlation of its chemical structure with chemical reactivity or physical properties. Miličević reformulated the original Zagreb indices in 2004, replacing vertex degrees by edge degrees. In this paper, we established the expressions for the reformulated Zagreb indices of some derived graphs such as a complement, line graph, subdivision graph, edge-semitotal graph, vertex-semitotal graph, total graph, and paraline graph of a graph.


2017 ◽  
Vol 09 (05) ◽  
pp. 1750064 ◽  
Author(s):  
Ali Ahmad

Graphene is an atomic scale honeycomb lattice made of the carbon atoms. Graph theory has given scientific expert an assortment of helpful apparatuses, for example, topological indices. A topological index [Formula: see text] of a graph [Formula: see text] is a number with the property that for each graph [Formula: see text] isomorphic to [Formula: see text] [Formula: see text] In this paper, we exhibit correct expressions for some topological indices for para-line graph of honeycomb networks and graphene.


Sign in / Sign up

Export Citation Format

Share Document