scientific article; zbMATH DE number 1123784
From MaRDI portal
Publication:4379738
zbMath0890.05036MaRDI QIDQ4379738
Preben Dahl Vestergaard, L. K. Jørgensen, Bert L. Hartnell, Carol A. Whitehead
Publication date: 29 June 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)
Related Items (max. 100)
Edge criticality in graph domination ⋮ The k-power bondage number of a graph ⋮ The bondage number of generalized Petersen graphs \(P(n,2)\) ⋮ Bondage number of strong product of two paths ⋮ On the complexity of the bondage and reinforcement problems ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Upper bounds on the bondage number of the strong product of a graph and a tree ⋮ Bondage number of mesh networks ⋮ The total bondage number of grid graphs ⋮ On the complexity of the outer-connected bondage and the outer-connected reinforcement problems ⋮ Bondage numbers of Mycielski graphs ⋮ The bondage number of the strong product of a complete graph with a path and a special starlike tree ⋮ A bound on the size of a graph with given order and bondage number
This page was built for publication:
