Connected k-tuple twin domination in de Bruijn and Kautz digraphs

DOI10.1016/J.DISC.2009.05.031zbMATH Open1210.05092OpenAlexW2115265299MaRDI QIDQ1045016FDOQ1045016

Authors: Toru Araki 

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.031

Recommendations

• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• Twin domination in generalized de Bruijn and Kautz digraphs
• On the twin domination number in generalized de Bruijn and generalized Kautz digraphs
• On the \(k\)-tuple domination of de Bruijn and 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
• Twin domination in generalized Kautz digraphs
• \(k\)-tuple domination in generalized de Bruijn digraphs
• The twin domination number in generalized de Bruijn digraphs
• \(k\)-tuple domination in graphs

zbMATH Keywords

de Bruijn digraphKautz digraphline digraph1-factorizationsconnected \(k\)-tuple twin dominating set

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Construction of strongly connected dominating sets in asymmetric multihop wireless networks
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• Title not available (Why is that?)
• \(k\)-tuple domination in graphs
• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Characterizations of trees with equal paired and double domination numbers
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• Title not available (Why is that?)
• Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs

Cited In (7)

• The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks
• On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• On the \((h,k)\)-domination numbers of iterated line digraphs
• \(k\)-tuple domination in generalized de Bruijn digraphs
• On the \(k\)-tuple domination of de Bruijn and Kautz digraphs
• Partitioning vertices into in- and out-dominating sets in digraphs

This page was built for publication: Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045016)