On the k-tuple domination of de Bruijn and Kautz digraphs

DOI10.1016/J.IPL.2007.05.010zbMATH Open1183.05029OpenAlexW1968689466MaRDI QIDQ2380002FDOQ2380002

Authors: Toru Araki 

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.05.010

Recommendations

• On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
• \(k\)-tuple domination in generalized de Bruijn digraphs
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• The \(k\)-tuple twin domination in generalized de Bruijn and Kautz networks

zbMATH Keywords

interconnection networksde Bruijn digraphKautz digraph\(k\)-tuple domination

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?)
• Line Digraph Iterations and the (d, k) Digraph Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(k\)-tuple domination in graphs
• Title not available (Why is that?)
• A Design for Directed Graphs with Minimum Diameter
• Design to Minimize Diameter on Building-Block Network
• Completely independent spanning trees in the underlying graph of a line digraph
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• Super link-connectivity of iterated line digraphs.
• Extension of de Bruijn graph and Kautz graph
• The bondage numbers of extended de Bruijn and Kautz digraphs
• Diameter, short paths and superconnectivity in digraphs
• Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
• Factorization of de Bruijn digraphs by cycle-rooted trees
• Independence number of iterated line digraphs

Cited In (18)

• On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Twin domination in generalized 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
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• The twin domination number in generalized de Bruijn digraphs
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• On the \((h,k)\)-domination numbers of iterated line digraphs
• On the twin domination number in generalized de Bruijn and generalized Kautz digraphs
• Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• Distance domination of generalized de Bruijn and Kautz digraphs
• \(k\)-tuple domination in generalized de Bruijn digraphs
• Efficient twin domination in generalized de Bruijn digraphs
• On the domination number of $t$-constrained de Bruijn graphs
• Identifying codes on directed de Bruijn graphs
• On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs
• Constructing the minimum dominating sets of generalized de Bruijn digraphs

This page was built for publication: On the \(k\)-tuple domination of de Bruijn and Kautz digraphs

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