An exceptional invariant k-component order neighbor connectivity -- a generalization of domination alteration sets in graphs

zbMATH Open1420.05129MaRDI QIDQ5224743FDOQ5224743

Alicia Muth, Charles L. Suffel, Alexis Doucette

Publication date: 24 July 2019

Recommendations

• Neighborhood connected 2-domination number and connectivity of graphs
• The relationship between neighbor-connectivity, component order connectivity and neighbor-component order connectivity
• Dominating sets inducing large components in maximal outerplanar graphs
• Outer-\(k\)-connected component domination in graphs
• scientific article; zbMATH DE number 26480

zbMATH Keywords

network vulnerabilitycomponent order neighbor connectivitydomination alteration

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

This page was built for publication: An exceptional invariant $k$-component order neighbor connectivity -- a generalization of domination alteration sets in graphs

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