Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph |
| |
Authors: | Kinkar Ch. Das |
| |
Affiliation: | aDepartment of Mathematics, Sungkyunkwan University, Suwon 440-746, Republic of Korea |
| |
Abstract: | Let 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. |
| |
Keywords: | Graph theory Distance matrix Spectral radius Principal eigenvector Diameter (of graph) |
本文献已被 ScienceDirect 等数据库收录! |
|