scientific article; zbMATH DE number 1123784

MaRDI QIDQ4379738zbMATH OpenFDO

Authors L. K. Jørgensen, Preben Dahl Vestergaard, Bert L. Hartnell, Carol A. Whitehead

Publication date 29 June 1998

zbMATH Keywords

bondage numberdomination numbertree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• k-domination stable graphs upon edge removal.
• A lower bound for the distance \(k\)-domination number of trees
• The \(k\)-power bondage number of a graph
• New results about the bondage number of a graph
• 2-bondage in graphs

Cited in

(17)

• A bound on the size of a graph with given order and bondage number
• On bondage numbers of graphs: a survey with some comments
• The bondage number of generalized Petersen graphs \(P(n,2)\)
• A lower bound for the distance \(k\)-domination number of trees
• The bondage number of the strong product of a complete graph with a path and a special starlike tree
• k-domination stable graphs upon edge removal.
• Edge criticality in graph domination
• On reliability models associated with the edge domination number for trees
• On the complexity of the bondage and reinforcement problems
• Upper bounds on the bondage number of the strong product of a graph and a tree
• scientific article; zbMATH DE number 2109033 (Why is no real title available?)
• The \(k\)-power bondage number of a graph
• On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
• Bondage number of mesh networks
• The total bondage number of grid graphs
• Bondage numbers of Mycielski graphs
• Bondage number of strong product of two paths

This page was built for publication:

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