On algebraic connectivity augmentation
From MaRDI portal
Publication:550607
DOI10.1016/J.LAA.2010.06.044zbMATH Open1222.05161OpenAlexW2056881448MaRDI QIDQ550607FDOQ550607
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
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
- Matrix Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- The limit points of Laplacian spectra of graphs
- Title not available (Why is that?)
- Old and new results on algebraic connectivity of graphs
- On graphs with equal algebraic and vertex connectivity
- A note on limit points for algebraic connectivity
- Maximum algebraic connectivity augmentation is NP-hard
- On algebraic connectivity as a function of an edge weight
Cited In (1)
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)