Domination in rose window graphs

DOI10.1007/s40840-020-00960-5zbMath1458.05198OpenAlexW3037576526MaRDI QIDQ2227966

Štefko Miklavič, Marina Milićević, Primož Šparl, Dušan Jokanović

Publication date: 16 February 2021

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-020-00960-5

zbMATH Keywords

generalized Petersen graphdomination numberefficient dominationrose window graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Classification of tetravalent distance magic circulant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total domination and transformation
• Total perfect codes in Cayley graphs
• Efficient domination in cubic vertex-transitive graphs
• (Total) domination in prisms
• Perfect codes in circulant graphs
• Rose window graphs underlying rotary maps
• Vertex domination of generalized Petersen graphs
• Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
• The isomorphism problem for rose window graphs
• The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\)
• On the Domination Number of Generalized Petersen Graphs P(ck,k)
• Classification of edge-transitive rose window graphs
• The automorphism groups of non-edge-transitive rose window graphs
• Rose window graphs
• Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
• Arc‐transitive maps with underlying Rose Window graphs

This page was built for publication: Domination in rose window graphs