Constructing the minimum dominating sets of generalized de Bruijn digraphs

DOI10.1016/j.disc.2015.03.011zbMath1311.05074OpenAlexW1971297844MaRDI QIDQ2342640

Erfang Shan, Yanxia Dong, Li-ying Kang

Publication date: 29 April 2015

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

Full work available at URL: https://doi.org/10.1016/j.disc.2015.03.011

zbMATH Keywords

digraphcombinatorial problemsdominating setefficient dominationgeneralized de Bruijn digraph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ On the domination number of $t$-constrained de Bruijn graphs ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Orientable domination in product-like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks
• Directed domination in oriented graphs
• Efficient domination in cubic vertex-transitive graphs
• Efficient twin domination in generalized de Bruijn digraphs
• Particular cycles of a binary de Bruijn digraph
• The twin domination number in generalized de Bruijn digraphs
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• The Hamiltonian property of generalized de Bruijn digraphs
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• The spectrum of de Bruijn and Kautz graphs
• Counting closed walks in generalized de Bruijn graphs
• Efficient dominating sets in Cayley graphs.
• Worst-case efficient dominating sets in digraphs
• On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
• Absorbant of generalized de Bruijn digraphs
• Hamiltonicity of large generalized de Bruijn cycles
• Efficient dominating sets in labeled rooted oriented trees
• Connectivity of Regular Directed Graphs with Small Diameters
• Generalized de Bruijn digraphs
• Design to Minimize Diameter on Building-Block Network
• Counting small cycles in generalized de Bruijn digraphs

This page was built for publication: Constructing the minimum dominating sets of generalized de Bruijn digraphs