On the domination number of the circulant graphs C(n;\1,2\), C(n;\1,3\) and C(n;\1,4\).

zbMATH Open1265.05459MaRDI QIDQ4649976FDOQ4649976

Authors: Xueliang Fu, Yuansheng Yang, Baoqi Jiang 

Publication date: 15 November 2012

Recommendations

• Domination on circulant graphs with two chord length
• The integer \(\{k\}\)-domination number of circulant graphs
• scientific article; zbMATH DE number 6120615
• On the domination number of generalized petersen graphs \(P(n,2)\)
• On the domination number of generalized Petersen graphs \(P(n,3)\).

zbMATH Keywords

domination numberdominating setcirculant graph

Mathematics Subject Classification ID

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

Cited In (8)

• On domination number of Latin square graphs of finite cyclic groups
• The integer \(\{k\}\)-domination number of circulant graphs
• Title not available (Why is that?)
• On the distance paired-domination of circulant graphs
• Title not available (Why is that?)
• Domination ratio of a family of integer distance digraphs with arbitrary degree
• Domination on circulant graphs with two chord length
• The game of Cops and Robber on circulant graphs

This page was built for publication: On the domination number of the circulant graphs \(C(n;\{1,2\})\), \(C(n;\{1,3\})\) and \(C(n;\{1,4\})\).

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