scientific article; zbMATH DE number 6390824

MaRDI QIDQ2940103zbMATH OpenFDO

Authors Xin Xie, Jun-Ming Xu

Publication date 26 January 2015

zbMATH Keywords

circulant networkdomination number

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the (l,)-domination number of the cube network.
• The integer \(\{k\}\)-domination number of circulant graphs
• scientific article; zbMATH DE number 6120615
• Domination in generalized circulant graphs
• Domination in circulant graphs
• On the domination number of the circulant graphs \(C(n;\{1,2\})\), \(C(n;\{1,3\})\) and \(C(n;\{1,4\})\).
• The complexity of domination problems in circle graphs
• scientific article; zbMATH DE number 7310263
• Dominating sets and domatic number of circular arc graphs

Cited in

(3)

• On the (l,)-domination number of the cube network.
• Some network topological notions of the Mycielskian of a graph
• On the (l, 2n)-domination number of the n-dimensional undirected toroidal mesh

This page was built for publication:

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