On the Extremal Wiener Polarity Index of Hückel Graphs
Author
Source
Computational and Mathematical Methods in Medicine
Issue
Vol. 2016, Issue 2016 (31 Dec. 2016), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2016-05-09
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
Graphs are used to model chemical compounds and drugs.
In the graphs, each vertex represents an atom of molecule and edges between the corresponding vertices are used to represent covalent bounds between atoms.
The Wiener polarity index W p ( G ) of a graph G is the number of unordered pairs of vertices u , v of G such that the distance between u and v is equal to 3.
The trees and unicyclic graphs with perfect matching, of which all vertices have degrees not greater than three, are referred to as the Hückel trees and unicyclic Hückel graphs, respectively.
In this paper, we first consider the smallest and the largest Wiener polarity index among all Hückel trees on 2 n vertices and characterize the corresponding extremal graphs.
Then we obtain an upper and lower bound for the Wiener polarity index of unicyclic Hückel graphs on 2 n vertices.
American Psychological Association (APA)
Wang, Hongzhuan. 2016. On the Extremal Wiener Polarity Index of Hückel Graphs. Computational and Mathematical Methods in Medicine،Vol. 2016, no. 2016, pp.1-6.
https://search.emarefa.net/detail/BIM-1100122
Modern Language Association (MLA)
Wang, Hongzhuan. On the Extremal Wiener Polarity Index of Hückel Graphs. Computational and Mathematical Methods in Medicine No. 2016 (2016), pp.1-6.
https://search.emarefa.net/detail/BIM-1100122
American Medical Association (AMA)
Wang, Hongzhuan. On the Extremal Wiener Polarity Index of Hückel Graphs. Computational and Mathematical Methods in Medicine. 2016. Vol. 2016, no. 2016, pp.1-6.
https://search.emarefa.net/detail/BIM-1100122
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1100122