Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs
From MaRDI portal
Publication:5019804
Recommendations
- The minimum algebraic connectivity of graphs with a given clique number
- On minimum algebraic connectivity of graphs whose complements are bicyclic
- Extremal connected graphs for independent domination number
- On graphs with algebraic connectivity equal to minimum edge density
- scientific article; zbMATH DE number 3985264
- Minmax degree of graphs (extended abstract)
- Connectivity, graph minors, and subgraph multiplicity
- Minimizing algebraic connectivity over connected graphs with fixed girth
- On the minimum degree and the proper connection number of graphs
- Extraconnectivity of graphs with large minimum degree and girth
Cites work
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- A conjecture on algebraic connectivity of graphs
- Proof of a problem on Laplacian eigenvalues of trees
- Proof of conjectures involving algebraic connectivity of graphs
- The Laplacian spectral radius of trees and maximum vertex degree
- The Laplacian spectrum of a graph
- The six classes of trees with the largest algebraic connectivity
This page was built for publication: Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019804)