On graphs with algebraic connectivity equal to minimum edge density
type: Item
instance of: scholarly article
title: On graphs with algebraic connectivity equal to minimum edge density
zbMATH Open document ID: 1026.05075
DOI: 10.1016/S0024-3795(02)00538-4
author: Shaun M. Fallat
author: S. Pati
author: S. J. Kirkland
published in: Linear Algebra and its Applications
publication date: 2003-11-19T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15A18
zbMATH DE Number: 2005970
MaRDI profile type: Publication
cites work: Q3907599
cites work: Perron components and algebraic connectivity for weighted graphs
cites work: Q5682350
cites work: Eigenvectors of acyclic matrices
cites work: The Laplacian Spectrum of a Graph
cites work: Matrix Analysis
cites work: Laplacian matrices of graphs: A survey
cites work: A survey of graph laplacians
cites work: Eigenvalues, diameter, and mean distance in graphs
cites work: Laplace eigenvalues of graphs---a survey
Recommended article: On graphs with equal algebraic and vertex connectivity
Recommended article: Q3356329
Recommended article: Minimizing algebraic connectivity over connected graphs with fixed girth
Recommended article: Q5276345
Recommended article: The least algebraic connectivity of graphs
Recommended article: Q5299651
Recommended article: On minimum algebraic connectivity of graphs whose complements are bicyclic
Recommended article: Graphs of given order and size and minimum algebraic connectivity
Recommended article: On the \(d\)-dimensional algebraic connectivity of graphs
Recommended article: On algebraic connectivity as a function of an edge weight
description: scientific article; zbMATH DE number 2005970