Some Algebraic Polynomials and Topological Indices of Generalized Prism and Toroidal Polyhex Networks

Ajmal, Muhammad; Nazeer, Waqas; Munir, Mobeen; Kang, Shin Min; Kwun, Young Chel

doi:10.3390/sym9010005

Cited by 24 publications

(14 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For estimating the alkanes boiling point, wiener suggested wiener index firstly in 1947. M polynomial also played the identical occupation in driving the secure structure of numberless degree based topological indices (Ajmal et al, 2016;Kulli, 2016;Klavžar and Gutman, 1996). Consequently, in Table 1, explicit expressions for some continuous degree based Topological indices are listed in Table 1.…”

Section: M-polynomialmentioning

confidence: 99%

M-polynomial and entropy of para-line graph of naphthalene

al.¹

2019

Int. j. adv. appl. sci.

View full text Add to dashboard Cite

The objective of this paper is to explore the stability of naphthalene (m, n). For a single unit of naphthalene, its stability is less relative to selfdimerization. For two units of naphthalene, there is a slight increase in stability and self-dimerization decreases as well. However, for (m, n) unit of Naphthalene, its stability increases rapidly and self-dimerization decreases proportionately. The M-Polynomial is extracted from praline graph of naphthalene which further yielded several degree-based topological indices. The analytical information function of a graph is entropy which uses probability density on the set of vertices. This paper computes the entropy of para-line graph of naphthalene (m, n) and its relationship with Randic index.

show abstract

Section: M-polynomialmentioning

confidence: 99%

M-polynomial and entropy of para-line graph of naphthalene

al.¹

2019

Int. j. adv. appl. sci.

View full text Add to dashboard Cite

show abstract

“…We are interested in the study of irregularity determinants of some famous dendrimers, namely, nanostar dendrimer D[p], fullerene dendrimer NS 4 [p], and polymer dendrimer NS 5 [p]. It has been keenly observed that the geometry and pattern of chemical systems characterize its physical aspects [16][17][18][19][20][21][22][23][24].…”

Section: Introductionmentioning

confidence: 99%

Molecular Irregularity Indices of Nanostar, Fullerene, and Polymer Dendrimers

Quan

Wang

Munir

et al. 2020

Journal of Chemistry

Self Cite

View full text Add to dashboard Cite

Dendrimers are highly branched organic macromolecules with successive layers of branch units surrounding a central core. Some properties like toxicity, entropy, and heats of vaporization of these dendrimers can be forecasted using topological indices. e present article is devoted to study of irregularity indices of three well-known classes of dendrimers, namely, nanostar dendrimer D [p], fullerene dendrimer NS 4 [p], and polymer dendrimerNS 5 [p], where p is the step size. We also see the relation of irregularity of these dendrimers on the step size graphically.

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

Some Algebraic Polynomials and Topological Indices of Generalized Prism and Toroidal Polyhex Networks

Cited by 24 publications

References 30 publications

M-polynomial and entropy of para-line graph of naphthalene

M-polynomial and entropy of para-line graph of naphthalene

Molecular Irregularity Indices of Nanostar, Fullerene, and Polymer Dendrimers

Tree-Antimagicness of Web Graphs and Their Disjoint Union

Contact Info

Product

Resources

About