Augmenting the algebraic connectivity for certain families of graphs

DOI10.1016/j.dam.2018.03.069zbMath1401.05165OpenAlexW2803100413WikidataQ129911465 ScholiaQ129911465MaRDI QIDQ1634763

Carlos Rocha, Emanuelle Chaves, Anderson Chaves, Geraldo Avelino, Claudia Marcela Justel

Publication date: 18 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.069

zbMATH Keywords

Laplacian matrixalgebraic connectivitygraph spectraapproximated algorithm

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (1)

2-connected graphs with the minimum algebraic connectivity

Uses Software

• Matlab
• nauty
• NetworkX

Cites Work

• Experiments with two heuristic algorithms for the maximum algebraic connectivity augmentation problem
• Old and new results on algebraic connectivity of graphs
• Absolute algebraic connectivity of double brooms and trees
• Eigenvalues, diameter, and mean distance in graphs
• Maximizing algebraic connectivity for certain families of graphs
• Maximum algebraic connectivity augmentation is NP-hard
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Ordering trees by algebraic connectivity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Augmenting the algebraic connectivity for certain families of graphs