On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs

DOI10.1016/S0166-218X(00)00199-2zbMath0963.05101MaRDI QIDQ1582075

Juming Xu, Chang-hong Lu, Ke Min Zhang

Publication date: 27 February 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

dominating setbinary directed de Bruijn graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

An unoriented variation on de Bruijn sequences ⋮ Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs

Cites Work

• Unnamed Item
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• Mengerian properties, hamiltonicity, and claw‐free graphs
• The wide-diameter of then-dimensional toroidal mesh
• 2-diameter of de Bruijn graphs

This page was built for publication: On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs