Results 1 to 10 of about 3,084 (95)
On vertex PI index of certain triangular tessellation networks
Main Group Metal Chemistry, 2021 The Wiener index, due to its many applications is considered to be one of very important distance-based index. But the Padmaker-Ivan (PI) index is kind of the only distance related index linked to parallelism of edges.
Bokhary Syed Ahtsham Ul Haq, Adnan
doaj +2 more sources
The vertex PI index and Szeged index of bridge graphs
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Toufik Mansour, Matthias Schork
exaly +2 more sources
Estimating the Vertex PI Index
Zeitschrift Fur Naturforschung - Section A Journal of Physical Sciences, 2010 The vertex PI index is a distance-based molecular structure descriptor, that recently found numerous chemical applications. Lower and upper bounds for PI are obtained, as well as results of Nordhaus-Gaddum type.
Kinkar Ch Das, Ivan Gutman
exaly +3 more sources
Extremal graphs with respect to the vertex PI index
Applied Mathematics Letters, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M J Nadjafi-Arani +2 more
exaly +3 more sources
A new method for computing the vertex PI index with applications to special classes of graphs
AKCE International Journal of Graphs and CombinatoricsThe Padmakar-Ivan (PI) index of a graph G is given by [Formula: see text], where [Formula: see text] is the number of equidistant vertices for the edge e.
S. C. Manju +2 more
doaj +2 more sources
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing [PDF]
TheoretiCS, 2022 A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from $G$ to any graph that is isomorphic to $G$. We say that $G=(V,E)$ is robustly self-ordered if the
Oded Goldreich, Avi Wigderson
doaj +1 more source
Cacti with Extremal PI Index [PDF]
Transactions on Combinatorics, 2016 The vertex PI index PI(G)=∑ xy∈E(G) [n xy (x)+n xy (y)] PI(G)=∑xy∈E(G)[nxy(x)+nxy(y)] is a distance-based molecular structure descriptor, where n xy (x) nxy(x) denotes the number of vertices which are closer to the vertex x x than to the vertex y y
Chunxiang Wang, Shaohui Wang , Bing Wei
doaj +3 more sources
The forwarding indices of graphs - a survey [PDF]
Opuscula Mathematica, 2013 A routing \(R\) of a connected graph \(G\) of order \(n\) is a collection of \(n(n-1)\) simple paths connecting every ordered pair of vertices of \(G\).
Jun-Ming Xu, Min Xu
doaj +1 more source
A New Alternative to Szeged, Mostar, and PI Polynomials—The SMP Polynomials
Mathematics, 2023 Szeged-like topological indices are well-studied distance-based molecular descriptors, which include, for example, the (edge-)Szeged index, the (edge-)Mostar index, and the (vertex-)PI index.
Martin Knor, Niko Tratnik
doaj +1 more source
Graph Invariants of Deleted Lexicographic Product of Graphs [PDF]
Mathematics Interdisciplinary Research, 2019 The deleted lexicographic product G[H]-nG of graphs G and H is a graph with vertex set V(G)×V(H) and u=(u1, v1) is adjacent with v=(u2, v2) whenever (u1=u2 and v1 is adjacent with v2) or (v1 ≠ v2 and u1 is adjacent with u2).
Bahare Akhavan Mahdavi +2 more
doaj +1 more source