The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
From MaRDI portal
Publication:2468904
DOI10.1016/j.camwa.2006.05.020zbMath1130.05044OpenAlexW2128495282MaRDI QIDQ2468904
Publication date: 30 January 2008
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2006.05.020
total dominationtotal bondage numberextended de Burijn digraphextended Kautz digraphminimum total dominating set
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (12)
Total domination and the Caccetta-Häggkvist conjecture ⋮ On the complexity of the bondage and reinforcement problems ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Efficient total domination in digraphs ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ The \(p\)-bondage number of trees ⋮ ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS ⋮ Bondage number of mesh networks ⋮ The total bondage number of grid graphs ⋮ The bondage number in complete \(t\)-partite digraphs ⋮ Reinforcement numbers of digraphs ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs
Cites Work
This page was built for publication: The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs