On the spectral radius of block graphs having all their blocks of the same size
From MaRDI portal
Publication:2052182
Recommendations
Cites work
- scientific article; zbMATH DE number 5280010 (Why is no real title available?)
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- Eigenspaces of graphs
- Graphs with small independence number minimizing the spectral radius
- Inverses of triangular matrices and bipartite graphs
- Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the adjacency matrix of a block graph
- On the eigenvalues of trees
- On the spectral radius of graphs with connectivity at most \(k\)
- Some spectral properties of uniform hypergraphs
- Spectral radius of uniform hypergraphs
Cited in
(5)- Maximization of the spectral radius of block graphs with a given dissociation number
- Block-indifference graphs: characterization, structural and spectral properties
- On a conjecture about the spectral radius of block graphs
- On the spectral radius of block graphs with prescribed independence number
- The extremal spectral radius of generalized block graphs
This page was built for publication: On the spectral radius of block graphs having all their blocks of the same size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052182)