Average independent domination in complementary prisms

MaRDI QIDQ4998519zbMATH OpenFDO

Authors Vecdi Aytac, Zeynep Nihan Odabaş Berberler

Publication date 8 July 2021

zbMATH Keywords

average independent dominationcomplementary prismsdominationgraph vulnerabilitynetwork design and communication

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Network design and communication in computer systems (68M10)

Recommendations

• Independent domination in complementary prisms
• Domination and total domination in complementary prisms
• Independent strong domination in complementary prisms
• Locating-domination in complementary prisms
• Maximal independent sets in complementary prism graphs.

Cited in

(6)

• Independent domination in complementary prisms
• Maximal independent sets in complementary prism graphs.
• Independent strong domination in complementary prisms
• A note on average domination and average independent domination numbers in graphs
• k-independence on complementary prism graphs
• Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set

This page was built for publication: Average independent domination in complementary prisms

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