On algebraic connectivity augmentation

DOI10.1016/J.LAA.2010.06.044MaRDI QIDQ550607zbMATH OpenOpenAlexFDO

Authors Carla Silva Oliveira, S. J. Kirkland, Claudia Justel

Publication date 13 July 2011

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

Full work available at URL https://doi.org/10.1016/j.laa.2010.06.044

zbMATH Keywords

graphLaplacian matrixalgebraic connectivity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 7651209
• Augmenting the algebraic connectivity for certain families of graphs
• Connectivity augmentation of graphs
• Maximum algebraic connectivity augmentation is NP-hard
• Approximation algorithms for connectivity augmentation problems
• Approximating connectivity augmentation problems
• Approximating connectivity augmentation problems
• Augmenting the connectivity of geometric graphs
• scientific article; zbMATH DE number 1263261
• ALGEBRAIC CONNECTIVITY

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 5065241 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• A note on limit points for algebraic connectivity
• Matrix Analysis
• Maximum algebraic connectivity augmentation is NP-hard
• Old and new results on algebraic connectivity of graphs
• On algebraic connectivity as a function of an edge weight
• On graphs with equal algebraic and vertex connectivity
• The limit points of Laplacian spectra of graphs

Cited in

(2)

• Finding diverse ways to improve algebraic connectivity through multi-start optimization
• Experiments with two heuristic algorithms for the maximum algebraic connectivity augmentation problem

This page was built for publication: On algebraic connectivity augmentation

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