A new method for computing the vertex PI index with applications to special classes of graphs
From MaRDI portal
Cites work
- A bird's eye view of the cut method and a survey of its applications in chemical graph theory
- A method of computing the PI index of benzenoid hydrocarbons using orthogonal cuts
- Claw-free graphs. I: Orientable prismatic graphs
- Eccentricity-based topological indices of a cyclic octahedron structure
- Extremal graphs with respect to the vertex PI index
- Further results on computation of topological indices of certain networks
- Hyper-Wiener and Wiener polarity indices of silicate and oxide frameworks
- On certain topological indices of octahedral and icosahedral networks
- On some topological indices of the tensor products of graphs
- On the extremal graphs with respect to the vertex PI index
- PI index of bicyclic graphs
- PI index of zig-zag polyhex nanotubes
- Padmakar-Ivan Index of Some Types of Perfect Graphs
- Poisson approximation of induced subgraph counts in an inhomogeneous random intersection graph model
- Revan and hyper-Revan indices of octahedral and icosahedral networks
- The vertex PI and Szeged indices of chain graphs
- The vertex PI index and Szeged index of bridge graphs
- The weighted vertex PI index
- Vertex and edge PI indices of Cartesian product graphs
- Weighted PI index of tensor product and strong product of graphs
- Wiener and vertex PI indices of the strong product of graphs
This page was built for publication: A new method for computing the vertex PI index with applications to special classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938264)
