Applications of the generalized hierarchical product of graphs in computing the vertex and edge PI indices of chemical graphs
DOI10.1007/s11587-013-0162-8zbMath1303.05170OpenAlexW2059296679WikidataQ61987592 ScholiaQ61987592MaRDI QIDQ480401
M. Tavakoli, Ali Reza Ashrafi, Freydoon Rahbarnia
Publication date: 8 December 2014
Published in: Ricerche di Matematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11587-013-0162-8
Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Cites Work
- Unnamed Item
- Vertex and edge Padmakar-Ivan indices of the generalized hierarchical product of graphs
- The \(k\)-zero-divisor hypergraph
- Vertex and edge PI indices of Cartesian product graphs
- A matrix method for computing Szeged and vertex PI indices of join and composition of graphs
- The hierarchical product of graphs
- The vertex PI index and Szeged index of bridge graphs
- The generalized hierarchical product of graphs
- Further results on hierarchical product of graphs
- THE VERTEX AND EDGE PI INDICES OF GENERALIZED HIERARCHICAL PRODUCT OF GRAPHS
This page was built for publication: Applications of the generalized hierarchical product of graphs in computing the vertex and edge PI indices of chemical graphs