On the spectral radius of block graphs having all their blocks of the same size

DOI10.1016/J.LAA.2021.11.006zbMATH Open1479.05196arXiv2007.08023OpenAlexW3213864363MaRDI QIDQ2052182FDOQ2052182

Luciano N. Grippo, Ezequiel Dratman, Cristian Conde

Publication date: 25 November 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Let $mathcalB(n,q)$ be the class of block graphs on $n$ vertices having all their blocks of the same size. We prove that if $GinmathcalB(n,q)$ has at most three pairwise adjacent cut vertices then the minimum spectral radius $ho(G)$ is attained at a unique graph. In addition, we present a lower bound for $ho(G)$ when $GinmathcalB(n,q)$.

Full work available at URL: https://arxiv.org/abs/2007.08023

Recommendations

• On a conjecture about the spectral radius of block graphs
• On the spectral radius of block graphs with prescribed independence number \(\alpha\)
• On the spectral radius of graphs with cut vertices
• A NOTE ON THE DISTANCE SPECTRAL RADIUS OF SOME GRAPHS
• scientific article; zbMATH DE number 5844325

zbMATH Keywords

block graphsspectral radius of a graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graph designs and isomorphic decomposition (05C51)

Cites Work

• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Eigenspaces of graphs
• Some spectral properties of uniform hypergraphs
• On the spectral radius of graphs with connectivity at most \(k\)
• Title not available (Why is that?)
• Inverses of triangular matrices and bipartite graphs
• Spectral radius of uniform hypergraphs
• On the eigenvalues of trees
• Title not available (Why is that?)
• Graphs with small independence number minimizing the spectral radius
• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• On the adjacency matrix of a block graph

Cited In (2)

• On a conjecture about the spectral radius of block graphs
• 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)