On the spectral radius of graphs: nonregular distance-hereditary graphs with given edge-connectivity, graphs with tree-width k and block graphs with prescribed independence number \alpha

MaRDI QIDQ6329501zbMATH OpenFDO

Authors Cristian Conde, Ezequiel Dratman, Luciano N. Grippo

Publication date 19 November 2019

Mathematics Subject Classification ID

Linear and multilinear algebra; matrix theory (15-XX) Combinatorics (05-XX)

Abstract: The edge-connectivity of a graph is the minimum number of edges whose deletion disconnects the graph. Let $Delta(G)$ the maximum degree of a graph $G$ and let $ho(G)$ be the spectral radius of $G$. In this article we present a lower bound for $Delta(G)-ho(G)$ in terms of the edge connectivity of $G$, where $G$ is a nonregular distance-hereditary graph. We also prove that $ho(G)$ reaches the maximum at a unique graph in $mathcalG$, when $vertV(G)vert=n$, and $mathcalG$ either is in the class of graphs with bounded tree-width or is in the class of block graphs with prescribed independence number.

This page was built for publication: On the spectral radius of graphs: nonregular distance-hereditary graphs with given edge-connectivity, graphs with tree-width $k$ and block graphs with prescribed independence number $\alpha$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6329501)