The spectral radius of a graph is the maximum eigenvalues of its adjacency matrix. In this paper, using the property of quotient graph, the sharp upper bounds for the spectral radii of some adhesive graphs are determi...The spectral radius of a graph is the maximum eigenvalues of its adjacency matrix. In this paper, using the property of quotient graph, the sharp upper bounds for the spectral radii of some adhesive graphs are determined.展开更多
文摘The spectral radius of a graph is the maximum eigenvalues of its adjacency matrix. In this paper, using the property of quotient graph, the sharp upper bounds for the spectral radii of some adhesive graphs are determined.