Topological indices of the subdivision graphs of the nanostructure TUC4C8(R) using M-polynomials

Swamy, Narahari Narasimha; Gangappa, Chandan Katigenahalli; Poojary, Prasanna; Sooryanarayana, B.; Mudalagiraiah, Nagesh Hadonahalli

doi:10.1080/09720529.2022.2027604

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An important class of algebraic polynomial introduced by Deutsch and Klavžar [3] called M-polynomial is used to determine the closest form of various topological indices based on degree. For more work done on finding topological indices using M-polynomial, we refer the reader to Khalaf et al [7], Kwun et al [8], Munir et al [10,11], and Swamy et al [12].…”

Section: Introductionmentioning

confidence: 99%

M-Polynomials and Degree-Based Topological Indices of Mycielskian of Paths and Cycles

Shilpa,

Gayathri,

Nagesh

et al. 2023

Comm. Math. Appl.

View full text Add to dashboard Cite

For a graph G, the M-polynomial is defined as M(G; x, y) = δ≤α≤β≤∆ m αβ (G)x α y β , where m αβ (α, β ≥ 1), is the number of edges ab of G such that deg G (a) = α and deg G (b) = β, and δ is the minimum degree and ∆ is the maximum degree of G. The physiochemical properties of chemical graphs are found by topological indices, in particular, the degree-based topological indices, which can be determined from an algebraic formula called M-polynomial. We compute the closest forms of M-polynomial for Mycielskian of paths and cycles. Further, we plot the 3-D graphical representation of M-polynomial. Finally, we derive some degree-based topological indices with the help of M-polynomial.

show abstract