The connectivity of a graph and its complement

DOI10.1016/j.dam.2008.05.012zbMath1178.05055OpenAlexW2067217885MaRDI QIDQ1003479

Angelika Hellwig, Lutz Volkmann

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.012

zbMATH Keywords

edge-connectivityvertex-connectivitycomplementary graphNordhaus-Gaddum type results

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (8)

Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ Locally symmetrically connected T₀-quasi-metric spaces ⋮ More on the rainbow disconnection in graphs ⋮ The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph ⋮ On conflict-free connection of graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Symmetrically connected and antisymmetrically connected \(T_0\)-quasi-metric extensions ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The connectivity of a graph and its complement