Reinforcement numbers of digraphs

DOI10.1016/j.dam.2009.01.002zbMath1204.05068OpenAlexW2037860668MaRDI QIDQ1026162

Jia Huang, Jian-Wei Wang, Jun-Ming Xu

Publication date: 24 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2009.01.002

zbMATH Keywords

dominationde Bruijn digraphsefficient dominating setKautz digraphsprivate neighborreinforcement number

Mathematics Subject Classification ID

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

Related Items (8)

Trees with maximum \(p\)-reinforcement number ⋮ The average lower reinforcement number of a graph ⋮ On the complexity of the bondage and reinforcement problems ⋮ Rainbow reinforcement numbers in digraphs ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ On the \(p\)-reinforcement and the complexity ⋮ On the complexity of the outer-connected bondage and the outer-connected reinforcement problems ⋮ Trees with 2-reinforcement number three

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• The bondage number of a graph
• Efficient domination of the orientations of a graph
• Efficient dominating sets in Cayley graphs.
• Bondage number of planar graphs
• Remarks on the bondage number of planar graphs
• Extension of de Bruijn graph and Kautz graph
• The bondage numbers and efficient dominations of vertex-transitive graphs
• The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
• On the bondage number of planar and directed graphs
• Independent perfect domination sets in Cayley graphs
• A Design for Directed Graphs with Minimum Diameter
• Theory and Application of Graphs

This page was built for publication: Reinforcement numbers of digraphs