The vertex PI index of a graph G is the sum over all edges uv ∈ E(G) of the number of vertices which are not equidistant to u and v. In this paper, the extremal values of this new topological index are computed. In particular, we prove that for each n-vertex graph 2 , where x denotes the greatest i
On the extremal graphs with respect to the vertex PI index
✍ Scribed by Aleksandar Ilić
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 293 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For k 3 0, pk(G) den ot e s the Lick-White vertex partition number of G. A graph G is called (n, k)-critical 'f 't I I is connected and for each edge e of G Pk (G -e) < pk (G) = n. We describe all (2, k&critical graphs and for n 23, k 2 1 we extend and simplify a result of Bollobas and Harary giving
A connected graph of order n is bicyclic if it has n + 1 edges. He et al. [C.X. He, J.Y. Shao, J.L. He, On the Laplacian spectral radii of bicyclic graphs, Discrete Math. 308 (2008) 5981-5995] determined, among the n-vertex bicyclic graphs, the first four largest Laplacian spectral radii together wi