2016
DOI: 10.1371/journal.pone.0167075
|View full text |Cite
|
Sign up to set email alerts
|

On the Wiener Polarity Index of Lattice Networks

Abstract: Network structures are everywhere, including but not limited to applications in biological, physical and social sciences, information technology, and optimization. Network robustness is of crucial importance in all such applications. Research on this topic relies on finding a suitable measure and use this measure to quantify network robustness. A number of distance-based graph invariants, also known as topological indices, have recently been incorporated as descriptors of complex networks. Among them the Wiene… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 21 publications
(11 citation statements)
references
References 47 publications
0
11
0
Order By: Relevance
“…The Wiener polarity index of fullerenes and hexagonal systems was studied in Behmaram et al [19]. The Wiener polarity index of square, hexagonal and triangular lattices were studied in Chen et al [20]. Recently, Arockiaraj et al [21] studied the hyper‐Wiener and Wiener polarity indices of silicate and oxide networks.…”
Section: Motivation and Important Resultsmentioning
confidence: 99%
“…The Wiener polarity index of fullerenes and hexagonal systems was studied in Behmaram et al [19]. The Wiener polarity index of square, hexagonal and triangular lattices were studied in Chen et al [20]. Recently, Arockiaraj et al [21] studied the hyper‐Wiener and Wiener polarity indices of silicate and oxide networks.…”
Section: Motivation and Important Resultsmentioning
confidence: 99%
“…The Wiener polarity index of a graph G is defined as WP()G={}{}u,v:dG()u,v=3,u,vV()G. It was observed [28] that WP()G=12vV()GNG3()v and the importance of W P has been demonstrated in various papers (see References [29, 30] for details). Suppose G is an acyclic graph, it was realized [31] that WP()G=italicuvE()G()du1×()dv1. If G is a C 3 ‐free and C 4 ‐free graph such that its different cycles have at most one common edge [30], WP()G=M2()GM1()G+E()G5NP()G3Nh()G, and that if G is a C 3 ‐free graph such that its different cycles have at most one common edge [29], WP()G=M2()GM1()G+E()G5Np()G3Nh()G…”
Section: Wiener Polarity Indicesmentioning
confidence: 99%
“…Tratnik gave a generalization of the results given in and applied his results to obtain a closed formula for the Wiener polarity index of phenylenes. Chen et al introduced a simple formula for computing the Wiener polarity number of a simple graph and for more information on this topic, we refer the interested readers to the papers for more information on this topic.…”
Section: Introductionmentioning
confidence: 99%