On algebraic connectivity augmentation
From MaRDI portal
Publication:550607
DOI10.1016/J.LAA.2010.06.044zbMATH Open1222.05161OpenAlexW2056881448MaRDI QIDQ550607FDOQ550607
Claudia Justel, S. J. Kirkland, Carla Silva Oliveira
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
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)
Recommendations
- Title not available (Why is that?) π π
- 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 π π
- Title not available (Why is that?) π π
- ALGEBRAIC CONNECTIVITY π π
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)