The maximum PI index of bicyclic graphs with even number of edges
From MaRDI portal
Publication:1739210
DOI10.1016/J.IPL.2019.02.001zbMath1481.05035OpenAlexW2912911031WikidataQ128491152 ScholiaQ128491152MaRDI QIDQ1739210
Publication date: 26 April 2019
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2019.02.001
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Related Items (2)
Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ Bounds on the weighted vertex PI index of cacti graphs
Cites Work
- Correction of the paper ``Bicyclic graphs with extremal values of PI index
- The PI index of phenylenes
- The PI index of product graphs
- The PI index of polyomino chains of \(4k\)-cycles
- Bicyclic graphs with extremal values of PI index
- A method of computing the PI index of benzenoid hydrocarbons using orthogonal cuts
- Bounds on the PI index of unicyclic and bicyclic graphs with given girth
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The maximum PI index of bicyclic graphs with even number of edges