Cut-edges and the independence number

MaRDI QIDQ5310097zbMATH OpenFDO

Authors Ryan Pepper, Greg M. Henry, Dillon Sexton

Publication date 8 October 2007

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Independence number and cut-vertices
• Three bounds on the independence number of a graph
• Fragile graphs with small independent cuts
• A new lower bound on the independence number of graphs
• On the independence number of a graph in terms of order and size

Cited in

(7)

• On the existence of edge cuts leaving several large components
• Generic rigidity of molecular graphs via ear decomposition
• Extremal Zagreb indices of graphs with a given number of cut edges
• Independence number and cut-vertices
• Fragile graphs with small independent cuts
• Sums of powers of the degrees of graphs with \(k\) cut edges
• On the extremal Zagreb indices of graphs with cut edges

This page was built for publication: Cut-edges and the independence number

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