On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
From MaRDI portal
Publication:1007577
DOI10.1016/S0020-0190(02)00479-9zbMATH Open1173.68607OpenAlexW2008542346MaRDI QIDQ1007577FDOQ1007577
Authors: Yosuke Kikuchi, Yukio Shibata
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00479-9
Recommendations
- scientific article; zbMATH DE number 1798168
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
- On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
- On the power domination number of de Bruijn and Kautz digraphs
- On the twin domination number in generalized de Bruijn and generalized Kautz digraphs
- \(k\)-tuple domination in generalized de Bruijn digraphs
- The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
- Distance domination of generalized de Bruijn and Kautz digraphs
- scientific article; zbMATH DE number 609926
- scientific article; zbMATH DE number 857070
kerneldomination numberdominating setinterconnection networksgeneralized de Bruijn digraphsabsorbantgeneralized Kautz digraphs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A combinatorial problem in logic
- Title not available (Why is that?)
- On domination and independent domination numbers of a graph
- Title not available (Why is that?)
- A Design for Directed Graphs with Minimum Diameter
- Design to Minimize Diameter on Building-Block Network
- Complexity of problems in games, graphs and algebraic equations
- On finding a minimum dominating set in a tournament
- Title not available (Why is that?)
- Complexity of finding k-path-free dominating sets in graphs
- Enumerating the kernels of a directed graph with no odd circuits
- Kernels in directed graphs: A poison game
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (27)
- Power domination in generalized undirected de Bruijn graphs and Kautz graphs
- Private out-domination number of generalized de Bruijn digraphs
- Bounds on the absorbant number of generalized Kautz digraphs
- On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs
- Bounds on the domination number of a digraph and its reverse
- Twin domination in generalized Kautz digraphs
- The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
- Title not available (Why is that?)
- Reinforcement numbers of digraphs
- The bondage numbers of extended de Bruijn and Kautz digraphs
- Efficient absorbants in generalized de Bruijn digraphs
- The twin domination number in generalized de Bruijn digraphs
- The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
- On the \((h,k)\)-domination numbers of iterated line digraphs
- On the twin domination number in generalized de Bruijn and generalized Kautz digraphs
- Efficient total domination in digraphs
- On the power domination number of de Bruijn and Kautz digraphs
- Distance domination of generalized de Bruijn and Kautz digraphs
- Absorbant of generalized de Bruijn digraphs
- On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
- The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
- Efficient twin domination in generalized de Bruijn digraphs
- On the domination number of $t$-constrained de Bruijn graphs
- Identifying codes on directed de Bruijn graphs
- On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs
- Constructing the minimum dominating sets of generalized de Bruijn digraphs
This page was built for publication: On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007577)