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

DOI10.1016/J.LAA.2021.11.006MaRDI QIDQ2052182zbMATH OpenOpenAlexFDO

Authors Cristian Conde, Ezequiel Dratman, Luciano N. Grippo

Publication date 25 November 2021

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

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

zbMATH Keywords

block graphsspectral radius of a graph

Mathematics Subject Classification ID

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

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)$.

Review text

In this article, the authors consider the class of block graphs having all their blocks of the same size (\(\geq 3\)) and the bounds for the spectral radius established by \textit {L. Lovász} and \textit {J. Pelikan} [Period. Math. Hung. 3, 175--182 (1973; Zbl 0247.05108)]. In such class, the unique graph that reaches the minimum spectral radius in the case where the graph has at most three pairwise adjacent cut vertices is provided. Additional bounds are discussed.

Recommendations

• On a conjecture about the spectral radius of block graphs
• On the spectral radius of block graphs with prescribed independence number
• 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

Cites work

• Eigenspaces of graphs
• Graphs with small independence number minimizing the spectral radius
• scientific article; zbMATH DE number 5280010 (Why is no real title available?)
• scientific article; zbMATH DE number 3482387 (Why is no real title available?)
• Inverses of triangular matrices and bipartite graphs
• Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
• On the adjacency matrix of a block graph
• On the eigenvalues of trees
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• 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)

• On a conjecture about the spectral radius of block graphs
• On the spectral radius of block graphs with prescribed independence number
• Block-indifference graphs: characterization, structural and spectral properties
• The extremal spectral radius of generalized block graphs
• Maximization of the spectral radius of block graphs with a given dissociation number

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)