The minimum algebraic connectivity of graphs with a given clique number

MaRDI QIDQ5276345zbMATH OpenFDO

Authors Jiming Guo, Wai Chee Shiu, Jianxi Li

Publication date 14 July 2017

zbMATH Keywords

algebraic connectivityclique numberkite graph

Mathematics Subject Classification ID

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

Recommendations

• The least algebraic connectivity of graphs
• The algebraic connectivity of graphs with given stability number
• The algebraic connectivity of graphs with given circumference
• 2-connected graphs with the minimum algebraic connectivity
• Graphs of given order and size and minimum algebraic connectivity

Cited in

(12)

• On graphs with algebraic connectivity equal to minimum edge density
• Minimizing algebraic connectivity over connected graphs with fixed girth
• On minimum algebraic connectivity of graphs whose complements are bicyclic
• Graphs of given order and size and minimum algebraic connectivity
• The algebraic connectivity of graphs with given circumference
• Minimum (n,k,t) clique graphs
• The algebraic connectivity of graphs with given stability number
• Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs
• Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles
• Algebraic connectivity of k-connected graphs.
• 2-connected graphs with the minimum algebraic connectivity
• Effects on the algebraic connectivity of weighted graphs under edge rotations

This page was built for publication: The minimum algebraic connectivity of graphs with a given clique number

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