On the \((h,k)\)-domination numbers of iterated line digraphs (Q444453): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.03.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1613361305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter vulnerability of iterated line digraphs in terms of the girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-connected graphs with small 2-connected dominating sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the out-domination and in-domination numbers of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super link-connectivity of iterated line digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian property of generalized de Bruijn digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized de Bruijn digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the diameter vulnerability of iterated line digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Set and Converse Dominating Set of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding iterated line digraphs in books / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queue layouts of iterated line directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of strongly connected dominating sets in asymmetric multihop wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in a digraph and in its reverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: The twin domination number in generalized de Bruijn digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, cycles, and arc‐connectivity in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatible Euler tours of \(K_n^{**}\) / rank
 
Normal rank

Latest revision as of 13:08, 5 July 2024

scientific article
Language Label Description Also known as
English
On the \((h,k)\)-domination numbers of iterated line digraphs
scientific article

    Statements

    On the \((h,k)\)-domination numbers of iterated line digraphs (English)
    0 references
    0 references
    0 references
    14 August 2012
    0 references
    (\(h
    0 references
    k\))-dominating set
    0 references
    arc-disjoint Hamilton cycles
    0 references
    iterated line digraphs
    0 references
    de Bruijn and Kautz digraphs
    0 references
    fault-tolerance
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers