Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph

AbstractLet G=(V,E) be a simple, connected and undirected graph with vertex set V(G) and edge set E(G). Also let D(G) be the distance matrix of a graph G (Janežič et al., 2007) [13]. Here we obtain Nordhaus–Gaddum-type result for the spectral radius of distance matrix of a graph.A sharp upper bound on the maximal entry in the principal eigenvector of an adjacency matrix and signless Laplacian matrix of a simple, connected and undirected graph are investigated in Das (2009) [4] and Papendieck and Recht (2000) [15]. Generally, an upper bound on the maximal entry in the principal eigenvector of a symmetric nonnegative matrix with zero diagonal entries and without zero diagonal entries are investigated in Zhao and Hong (2002) [21] and Das (2009) [4], respectively. In this paper, we obtain an upper bound on minimal entry in the principal eigenvector for the distance matrix of a graph and characterize extremal graphs. Moreover, we present the lower and upper bounds on maximal entry in the principal eigenvector for the distance matrix of a graph and characterize extremal graphs

Comparison Between Zagreb Eccentricity Indices and the Eccentric Connectivity Index, the Second Geometric-arithmetic Index and the Graovac-Ghorbani Index

The concept of Zagreb eccentricity indices was introduced in the chemical graph theory very recently. The eccentric connectivity index is a distance-based molecular structure descriptor that was used for mathematical modeling of biological activities of diverse nature. The second geometric-arithmetic index was introduced in 2010, is found to be useful tool in QSPR and QSAR studies. In 2010 Graovac and Ghorbani introduced a distance-based analog of the atom-bond connectivity index, the Graovac-Ghorbani index, which yielded promising results when compared to analogous descriptors. In this note we prove that for chemical trees T. For connected graph G of order n with maximum degree, it is proved that if and, otherwise. Moreover, we show that for paths and some class of bipartite graphs. This work is licensed under a Creative Commons Attribution 4.0 International License

Sharp Bounds on (Generalized) Distance Energy of Graphs

Given a simple connected graph G, let D(G) be the distance matrix, DL(G) be the distance Laplacian matrix, DQ(G) be the distance signless Laplacian matrix, and Tr(G) be the vertex transmission diagonal matrix of G. We introduce the generalized distance matrix Dα(G)=αTr(G)+(1−α)D(G) , where α∈[0,1] . Noting that D0(G)=D(G),2D12(G)=DQ(G),D1(G)=Tr(G) and Dα(G)−Dβ(G)=(α−β)DL(G) , we reveal that a generalized distance matrix ideally bridges the spectral theories of the three constituent matrices. In this paper, we obtain some sharp upper and lower bounds for the generalized distance energy of a graph G involving different graph invariants. As an application of our results, we will be able to improve some of the recently given bounds in the literature for distance energy and distance signless Laplacian energy of graphs. The extremal graphs of the corresponding bounds are also characterized

Estimating the Vertex PI Index

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. Also a relation between the Szeged and vertex PI indices is established

On the energy and spectral properties of the he matrix of hexagonal systems

summary:The He matrix, put forward by He and He in 1989, is designed as a means for uniquely representing the structure of a hexagonal system (= benzenoid graph). Observing that the He matrix is just the adjacency matrix of a pertinently weighted inner dual of the respective hexagonal system, we establish a number of its spectral properties. Afterwards, we discuss the number of eigenvalues equal to zero of the He matrix of a hexagonal system. Moreover, we obtain a relation between the number of triangles and the eigenvalues of the He matrix of a hexagonal system. Finally, we present an upper bound on the He energy of hexagonal systems

Comparison between atom-bond connectivity indices of graphs

The atom-bond connectivity index ABC is a much studied degree-based graph invariant with noteworthy applications in chemistry. Few years ago, a new distance-based variant of this index, ABCGG, was introduced. We establish relations between the two ABC-indices. In particular, we determine classes of graph for which ABC is greater than (resp. equal to or less than) ABCGG