Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs
DOI10.2298/FIL1718545CzbMATH Open1499.05356OpenAlexW2795568637MaRDI QIDQ5019804FDOQ5019804
Authors: Muhuo Liu, Kinkar Ch. Das 
Publication date: 11 January 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1718545c
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Proof of a problem on Laplacian eigenvalues of trees
- The Laplacian spectrum of a graph
- Proof of conjectures involving algebraic connectivity of graphs
- The Laplacian spectral radius of trees and maximum vertex degree
- A conjecture on algebraic connectivity of graphs
- The six classes of trees with the largest algebraic connectivity
Cited In (1)
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)
