scientific article; zbMATH DE number 975422
From MaRDI portal
Publication:5284099
zbMath0862.05071MaRDI QIDQ5284099
No author found.
Publication date: 4 February 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
On the bondage, strong and weak bondage numbers in complementary prism graphs ⋮ RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS ⋮ Total restrained reinforcement in graphs ⋮ The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs ⋮ On the complexity of reinforcement in graphs ⋮ Complexity and bounds for disjunctive total bondage ⋮ Trees with maximum \(p\)-reinforcement number ⋮ The average lower reinforcement number of a graph ⋮ Quasi-total Roman reinforcement in graphs ⋮ On the complexity of the bondage and reinforcement problems ⋮ Restrained Italian reinforcement number in graphs ⋮ A note on total reinforcement in graphs ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ On domination and reinforcement numbers in trees ⋮ The \(k\)-rainbow reinforcement numbers in graphs ⋮ On the \(p\)-reinforcement and the complexity ⋮ On the complexity of the outer-connected bondage and the outer-connected reinforcement problems ⋮ Secure domination subdivision number of a graph ⋮ Reinforcement numbers of digraphs ⋮ The restrained k-rainbow reinforcement number of graphs ⋮ Double Roman reinforcement number in graphs ⋮ Restrained k-rainbow reinforcement number in graphs ⋮ Total Roman domination subdivision number in graphs ⋮ Trees with 2-reinforcement number three
This page was built for publication:
