On the \((h,k)\)-domination numbers of iterated line digraphs
From MaRDI portal
Publication:444453
DOI10.1016/j.dam.2012.03.024zbMath1246.05118OpenAlexW1613361305MaRDI QIDQ444453
Publication date: 14 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.024
fault-tolerance(\(harc-disjoint Hamilton cyclesde Bruijn and Kautz digraphsiterated line digraphsk\))-dominating set
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Queue layouts of iterated line directed graphs
- Domination in a digraph and in its reverse
- The twin domination number in generalized de Bruijn digraphs
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
- The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- The Hamiltonian property of generalized de Bruijn digraphs
- On the out-domination and in-domination numbers of a digraph
- Approximation algorithms for connected dominating sets
- Compatible Euler tours of \(K_n^{**}\)
- Super link-connectivity of iterated line digraphs.
- 2-connected graphs with small 2-connected dominating sets.
- Generalized de Bruijn digraphs
- Diameter vulnerability of iterated line digraphs in terms of the girth
- Paths, cycles, and arc‐connectivity in digraphs
- Embedding iterated line digraphs in books
- Dominating Set and Converse Dominating Set of a Directed Graph
- New bounds on the diameter vulnerability of iterated line digraphs
This page was built for publication: On the \((h,k)\)-domination numbers of iterated line digraphs