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

MaRDI QIDQ4649976zbMATH OpenFDO

Authors Xueliang Fu, Yuansheng Yang, Baoqi Jiang

Publication date 15 November 2012

zbMATH Keywords

circulant graphdominating setdomination number

Mathematics Subject Classification ID

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

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).

Cited in

(9)

• Domination ratio of a family of integer distance digraphs with arbitrary degree
• scientific article; zbMATH DE number 6390824 (Why is no real title available?)
• scientific article; zbMATH DE number 7227817 (Why is no real title available?)
• scientific article; zbMATH DE number 1161377 (Why is no real title available?)
• Domination on circulant graphs with two chord length
• The game of Cops and Robber on circulant graphs
• The integer \(\{k\}\)-domination number of circulant graphs
• On domination number of Latin square graphs of finite cyclic groups
• On the distance paired-domination of 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)