Strong weak domination in complementary prisms

zbMATH Open1316.05092MaRDI QIDQ5260891FDOQ5260891

Authors: Aysun Aytaç, Tufan Turaci 

Publication date: 30 June 2015

Full work available at URL: http://online.watsci.org/abstract_pdf/2015v22/v22n2b-pdf/1.pdf

Recommendations

• Independent strong domination in complementary prisms
• On strong and weak domination numbers in graphs
• Strong weak domination and domination balance in a graph
• Strong-weak domatic numbers of graphs
• Weak and strong domination in thorn graphs

zbMATH Keywords

graph algorithmsconnectivitynetwork design and communicationgraph vulnerabilityweak domination numberstrong domination numbercomplementary prisms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cited In (7)

• On the bondage, strong and weak bondage numbers in complementary prism graphs
• Strong-weak domatic numbers of graphs
• Domination and total domination in complementary prisms
• Strong independent saturation in complementary prisms
• Weak and strong domination in thorn graphs
• Independent strong domination in complementary prisms
• Independent transversal domination number in complementary prisms

This page was built for publication: Strong weak domination in complementary prisms

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