The Minimum Distance Eigenvalue of a Tricyclic Graph
Let G be a connected graph with vertex set V(G)={v1,v2,,vn}.Thedistance matrix of G is denoted by D(G)=(dij)n×n,where dij is the distance between vi and vj.The least eigenvalue of D(G)is also called the least distance eigenvalue of G.Suppose E(G)is the edge set of graph G.Then G is tricyclic if it satisfies|E(G)|=|V(G)|+2.In this paper,all tricyclic graphs with least distance eigenvalues in(-2-√2,-2]are determined.
tricyclic graphsdistance matrixthe least distance eigenvalue
NETL
NSTL
万方数据
