The connectivity of a graph and its complement

DOI10.1016/J.DAM.2008.05.012zbMATH Open1178.05055OpenAlexW2067217885MaRDI QIDQ1003479FDOQ1003479

Authors: 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

Recommendations

• The algebraic connectivity of a graph and its complement
• The connectivity of a bipartite graph and its bipartite complementary graph
• scientific article; zbMATH DE number 410204
• Connected graphs and their connectivities
• A note on the algebraic connectivity of a graph and its complement
• The connectivity of commuting graphs
• scientific article; zbMATH DE number 4023324
• The \(g\)-component connectivity of graphs
• Proper connection numbers of complementary graphs
• Connected domination number of a graph and its complement

zbMATH Keywords

complementary graphedge-connectivityvertex-connectivityNordhaus-Gaddum type results

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (20)

• Symmetrically connected and antisymmetrically connected \(T_0\)-quasi-metric extensions
• Group connectivity of complementary graphs
• Title not available (Why is that?)
• Star complements and connectivity in finite graphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• A note on adjacency-transitivity of a graph and its complement
• More on the rainbow disconnection in graphs
• Star complements and edge-connectivity in finite graphs
• Title not available (Why is that?)
• Locally symmetrically connected T₀-quasi-metric spaces
• Title not available (Why is that?)
• On conflict-free connection of graphs
• The connected component of the partial duplication graph
• The connectivity of a bipartite graph and its bipartite complementary graph
• On the Strongly Connected and Biconnected Components of the Complement of Graphs
• Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs
• The \(g\)-component connectivity of graphs
• An extremal problem on the connectivity of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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

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