On connected co-independent domination in the join, corona and lexicographic product of graphs

DOI10.1142/S1793830922501117MaRDI QIDQ6132866zbMATH OpenFDO

Authors

Publication date 15 July 2023

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

coronajoinlexicographic productconnected co-independent domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 5972305
• The total co-independent domination number of some graph operations
• Outer-connected 2-dominating sets of graphs
• Independent \((1, 2)\)-domination in graphs
• Clique doubly connected domination in the join and lexicographic product of graphs

Cites work

• scientific article; zbMATH DE number 5972305 (Why is no real title available?)
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• Connected monophonic domination in graphs
• Double hop dominating sets in graphs
• Doubly connected bi-domination in graphs
• Movable resolving domination in graphs
• On computing secure domination of trees
• Towards a theory of domination in graphs

Cited in

(4)

• The total co-independent domination number of some graph operations
• Clique doubly connected domination in the join and lexicographic product of graphs
• Cost effective domination in the join, corona and composition of graphs
• Partial domination in the join, corona, lexicographic and Cartesian products of graphs

This page was built for publication: On connected co-independent domination in the join, corona and lexicographic product of graphs

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