A bound on the size of a graph with given order and bondage number

DOI10.1016/S0012-365X(99)90093-6zbMath0960.05074OpenAlexW4245806810MaRDI QIDQ1292849

Douglas F. Rall, Bert L. Hartnell

Publication date: 17 May 2001

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90093-6

zbMATH Keywords

domination numberbondage number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Upper bounds for domination related parameters in graphs on surfaces ⋮ Complexity and bounds for disjunctive total bondage ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Bondage number of grid graphs ⋮ Unnamed Item ⋮ Upper bounds on the bondage number of the strong product of a graph and a tree ⋮ On the double bondage number of graphs products ⋮ Upper bounds on the bondage number of a graph

Cites Work

• Domination alteration sets in graphs
• On the bondage number of a graph
• The bondage number of a graph
• The discipline number of a graph
• A counterexample to a conjecture on the bondage number of a graph
• Bounds on the bondage number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A bound on the size of a graph with given order and bondage number