On the \((h,k)\)-domination numbers of iterated line digraphs
type: Item
instance of: scholarly article
title: On the \((h,k)\)-domination numbers of iterated line digraphs
zbMATH Open document ID: 1246.05118
author: Toru Hasunuma
author: Mayu Otani
published in: Discrete Applied Mathematics
publication date: 2012-08-14T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 6065748
zbMATH Keywords: (\(h
zbMATH Keywords: k\))-dominating set
zbMATH Keywords: arc-disjoint Hamilton cycles
zbMATH Keywords: iterated line digraphs
zbMATH Keywords: de Bruijn and Kautz digraphs
zbMATH Keywords: fault-tolerance
MaRDI profile type: Publication
full work available at URL: j.dam.2012.03.024
OpenAlex ID: W1613361305
cites work: The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
cites work: Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
cites work: Diameter vulnerability of iterated line digraphs in terms of the girth
cites work: 2-connected graphs with small 2-connected dominating sets.
cites work: Q5463344
cites work: On the out-domination and in-domination numbers of a digraph
cites work: Super link-connectivity of iterated line digraphs.
cites work: The Hamiltonian property of generalized de Bruijn digraphs
cites work: Generalized de Bruijn digraphs
cites work: New bounds on the diameter vulnerability of iterated line digraphs
cites work: Q3972098
cites work: Dominating Set and Converse Dominating Set of a Directed Graph
cites work: Approximation algorithms for connected dominating sets
cites work: Q4953552
cites work: Embedding iterated line digraphs in books
cites work: Queue layouts of iterated line directed graphs
cites work: Q4368729
cites work: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
cites work: Q3428642
cites work: Construction of strongly connected dominating sets in asymmetric multihop wireless networks
cites work: Domination in a digraph and in its reverse
cites work: The twin domination number in generalized de Bruijn digraphs
cites work: Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
cites work: Paths, cycles, and arc‐connectivity in digraphs
cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
cites work: Compatible Euler tours of \(K_n^{**}\)
DOI: 10.1016/J.DAM.2012.03.024
description: scientific article; zbMATH DE number 6065748