On the Spectral Radius of the Maximum Degree Matrix of Graphs
Open Access
- 26 May 2025
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1769
Abstract
Let G be a graph with n vertices, and let denote the degree of vertex u in The maximum degree matrix of G is the square matrix of order n whose -entry is equal to if vertices u and v are adjacent in G, and zero otherwise. Let be the graph obtained from the complete graph by removing an edge , and identifying vertices u and v with the end vertices and of the paths and , respectively. Let denote the set of simple, connected graphs with n vertices and diameter d. A graph in that attains the largest spectral radius of the maximum degree matrix is called a maximizing graph. In this paper, we first characterize the spectrum of the maximum degree matrix for graphs of the form , where . Furthermore, for we prove that the maximizing graph in is Finally, if is an even integer, then the spectral radius of the maximum degree matrix in can be computed as the largest eigenvalue of a symmetric tridiagonal matrix of order .
Keywords
This publication has 13 references indexed in Scilit:
- On the α-index of graphs with pendent pathsLinear Algebra and its Applications, 2018
- A conjecture on the diameter and signless Laplacian index of graphsLinear Algebra and its Applications, 2014
- Eigenvalues of a H -generalized join graph operation constrained by vertex subsetsLinear Algebra and its Applications, 2013
- Spectra of graphs obtained by a generalization of the join graph operationDiscrete Mathematics, 2013
- On bags and bugsDiscrete Applied Mathematics, 2008
- Minimizing the Laplacian spectral radius of trees with given matching numberLinear and Multilinear Algebra, 2007
- Numerical Linear Algebra1997
- Graph-Theoretic Concepts in Computer Science1995
- Nonnegative Matrices in the Mathematical Sciences1994
- Matrix Analysis1985