Total domination in cubic Knodel graphs

DOI10.22049/cco.2020.26793.1143zbMath1488.05390arXiv1804.02532OpenAlexW3165384768MaRDI QIDQ4957563

E. Nazari Kiashi, Doost Ali Mojdeh, Reza S. Musawi, Nader Jafari Rad

Publication date: 9 September 2021

Full work available at URL: https://arxiv.org/abs/1804.02532

zbMATH Keywords

domination numbertotal domination numberKnödel graphpigeonhole principle

Mathematics Subject Classification ID

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

Related Items (5)

Domination in Kn\"odel Graphs ⋮ Diameter of General Knödel Graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ Unnamed Item ⋮ Domination in 4-regular Knödel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds on the broadcast function using minimum dominating sets
• New gossips and telephones
• A survey on Knödel graphs.
• Power domination in Knödel graphs and Hanoi graphs
• More broadcast graphs
• The shortest path problem in the Knödel graph
• A new construction of broadcast graphs
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• An Efficient Vertex Addition Method for Broadcast Networks
• On the minimum path problem in Knödel graphs
• A Note on the Dimensionality of Modified Knödel Graphs
• Total Domination in Graphs
• Minimum multiple message broadcast graphs

This page was built for publication: Total domination in cubic Knodel graphs