On the domination number of $t$-constrained de Bruijn graphs

DOI10.46298/dmtcs.8879zbMath1516.05160arXiv2112.10426WikidataQ114020618 ScholiaQ114020618MaRDI QIDQ6045459

Blerina Sinaimeri, Angelo Monti, Tiziana Calamoneri

Publication date: 31 May 2023

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.10426

zbMATH Keywords

de Bruijn graphKautz graphdomination number

Mathematics Subject Classification ID

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

Related Items (1)

Recognizing k -Leaf Powers in Polynomial Time, for Constant k

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of Kautz networks
• Bibliography on domination in graphs and some basic definitions of domination parameters
• The exact domination number of the generalized Petersen graphs
• The domination number of the graph defined by two levels of the \(n\)-cube
• The domination number of the graph defined by two levels of the \(n\)-cube. II
• Constructing the minimum dominating sets of generalized de Bruijn digraphs
• On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
• The domination number of Cartesian product of two directed paths
• The Domination Number of On-line Social Networks and Random Geometric Graphs
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• An Eulerian path approach to DNA fragment assembly
• Structures of Domination in Graphs
• Topics in Domination in Graphs

This page was built for publication: On the domination number of $t$-constrained de Bruijn graphs