On the \(k\)-tuple domination of de Bruijn and Kautz digraphs (Q2380002): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2007.05.010 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3827949 / 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: Line Digraph Iterations and the (d, k) Digraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely independent spanning trees in the underlying graph of a line digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bondage numbers of extended de Bruijn and Kautz digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Design for Directed Graphs with Minimum Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design to Minimize Diameter on Building-Block Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence number of iterated line digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of de Bruijn digraphs by cycle-rooted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs / 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: Algorithmic aspect of \(k\)-tuple domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter, short paths and superconnectivity in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of de Bruijn graph and Kautz graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2007.05.010 / rank
 
Normal rank

Latest revision as of 07:21, 18 December 2024

scientific article
Language Label Description Also known as
English
On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
scientific article

    Statements

    On the \(k\)-tuple domination of de Bruijn and Kautz digraphs (English)
    0 references
    24 March 2010
    0 references
    \(k\)-tuple domination
    0 references
    de Bruijn digraph
    0 references
    Kautz digraph
    0 references
    interconnection networks
    0 references
    0 references

    Identifiers