Reinforcement numbers of digraphs

DOI10.1016/J.DAM.2009.01.002MaRDI QIDQ1026162zbMATH OpenOpenAlexFDO

Authors Jia Huang, Jianwei 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

dominationefficient dominating setKautz digraphsde Bruijn digraphsprivate neighborreinforcement number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 975422
• On the Italian reinforcement number of a digraph
• Roman reinforcement numbers of digraphs
• Rainbow reinforcement numbers in digraphs
• On domination and reinforcement numbers in trees

Cites work

• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 637526 (Why is no real title available?)
• scientific article; zbMATH DE number 1124610 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• scientific article; zbMATH DE number 975422 (Why is no real title available?)
• A Design for Directed Graphs with Minimum Diameter
• Bondage number of planar graphs
• Efficient dominating sets in Cayley graphs.
• Efficient domination of the orientations of a graph
• Extension of de Bruijn graph and Kautz graph
• Independent perfect domination sets in Cayley graphs
• On the bondage number of planar and directed graphs
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• Remarks on the bondage number of planar graphs
• The bondage number of a 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
• Theory and Application of Graphs

Cited in

(12)

• On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
• Trees with 2-reinforcement number three
• The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
• scientific article; zbMATH DE number 975422 (Why is no real title available?)
• Trees with maximum \(p\)-reinforcement number
• On the complexity of the bondage and reinforcement problems
• On the Italian reinforcement number of a digraph
• Reinforcement number of a graph with respect to half-domination
• The average lower reinforcement number of a graph
• On the \(p\)-reinforcement and the complexity
• On domination and reinforcement numbers in trees
• Rainbow reinforcement numbers in digraphs

This page was built for publication: Reinforcement numbers of digraphs

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