Strong weak domination in complementary prisms

MaRDI QIDQ5260891zbMATH OpenFDO

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, http://online.watsci.org/fulltext_b_pdf/2015v22/v22n2b-pdf/1.pdf

zbMATH Keywords

complementary prismsconnectivitygraph algorithmsgraph vulnerabilitynetwork design and communicationstrong domination numberweak domination number

Mathematics Subject Classification ID

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

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

Cited in

(8)

• Strong-weak domatic numbers of graphs
• Strong independent saturation in complementary prisms
• Independent strong domination in complementary prisms
• Weak and strong domination on some graphs
• Weak and strong domination in thorn graphs
• Independent transversal domination number in complementary prisms
• On the bondage, strong and weak bondage numbers in complementary prism graphs
• Domination and total domination 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)