Artículo

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

Conde, Cristian MarceloIcon ; Dratman, EzequielIcon ; Grippo, Luciano NorbertoIcon
Fecha de publicación: 02/2022
Editorial: Elsevier Science Inc.
Revista: Linear Algebra and its Applications
ISSN: 0024-3795
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:

Resumen

Let B(n,q) be the class of block graphs on n vertices having all their blocks of the same size. We prove that if G∈B(n,q) has at most three pairwise adjacent cut vertices then the minimum spectral radius ρ(G) is attained at a unique graph. In addition, we present a lower bound for ρ(G) when G∈B(n,q).
Palabras clave: BLOCK GRAPHS , SPECTRAL RADIUS OF A GRAPH
 
Archivos asociados
Tamaño: 350.6Kb
Formato: PDF
.
Licencia
info:eu-repo/semantics/restrictedAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)
Identificadores
URI: http://hdl.handle.net/11336/200245
URL: https://www.sciencedirect.com/science/article/pii/S0024379521004067
DOI: http://dx.doi.org/10.1016/j.laa.2021.11.006
Colecciones
Articulos(IAM)
Articulos de INST.ARG.DE MATEMATICAS "ALBERTO CALDERON"
Articulos(SEDE CENTRAL)
Articulos de SEDE CENTRAL
Citación
Conde, Cristian Marcelo; Dratman, Ezequiel; Grippo, Luciano Norberto; On the spectral radius of block graphs having all their blocks of the same size; Elsevier Science Inc.; Linear Algebra and its Applications; 634; 2-2022; 137-148
Compartir
Altmétricas