On Clark and Suen bound-type results fork-domination and Roman domination of Cartesian product graphs

DOI10.1080/00207160.2012.742513zbMath1273.05161OpenAlexW2122232142MaRDI QIDQ2852110

Ismael González Yero

Publication date: 8 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.742513

zbMATH Keywords

domination numberCartesian product graphsRoman domination number\(k\)-domination number

Mathematics Subject Classification ID

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

Related Items (3)

Roman domination in direct product graphs and rooted product graphs ⋮ Total Roman domination in the lexicographic product of graphs ⋮ Some improved inequalities related to Vizing's conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Roman domination in graphs.
• An improvement on Vizing's conjecture
• Vizing's conjecture: a survey and recent results

This page was built for publication: On Clark and Suen bound-type results fork-domination and Roman domination of Cartesian product graphs