Back to Search
Start Over
Unoriented Laplacian maximizing graphs are degree maximal
- Source :
-
Linear Algebra & its Applications . Aug2008, p735-758. 24p. - Publication Year :
- 2008
-
Abstract
- Abstract: A connected graph is said to be unoriented Laplacian maximizing if the spectral radius of its unoriented Laplacian matrix attains the maximum among all connected graphs with the same number of vertices and the same number of edges. A graph is said to be threshold (maximal) if its degree sequence is not majorized by the degree sequence of any other graph (and, in addition, the graph is connected). It is proved that an unoriented Laplacian maximizing graph is maximal and also that there are precisely two unoriented Laplacian maximizing graphs of a given order and with nullity 3. Our treatment depends on the following known characterization: a graph is threshold (maximal) if and only if for every pair of vertices of , the sets , where denotes the neighbor set of in , are comparable with respect to the inclusion relation (and, in addition, the graph is connected). A conjecture about graphs that maximize the unoriented Laplacian matrix among all graphs with the same number of vertices and the same number of edges is also posed. [Copyright &y& Elsevier]
- Subjects :
- *LAPLACIAN operator
*MATRICES (Mathematics)
*GRAPHIC methods
*GRAPH theory
Subjects
Details
- Language :
- English
- ISSN :
- 00243795
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 32558897
- Full Text :
- https://doi.org/10.1016/j.laa.2008.04.002