Clique doubly connected domination in the join and lexicographic product of graphs

DOI10.1142/S1793830920500664zbMath1457.05077OpenAlexW3044961202MaRDI QIDQ5858176

Albert D. Ngujo, Enrico L. Enriquez

Publication date: 9 April 2021

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

Full work available at URL: https://doi.org/10.1142/s1793830920500664

zbMATH Keywords

joinlexicographic productclique dominating setdoubly connected domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Convex domination in the composition and cartesian product of graphs
• Strong vb-dominating and vb-independent sets of a graph
• Outer-convex domination in graphs
• A linear algorithm for double Roman domination of proper interval graphs
• Bounds on the signed total Roman 2-domination in graphs

This page was built for publication: Clique doubly connected domination in the join and lexicographic product of graphs