Interpolation theorems for domination numbers of a graph

DOI10.1016/S0012-365X(98)00108-3zbMath0958.05103MaRDI QIDQ1584415

Preben Dahl Vestergaard, Jerzy Topp

Publication date: 2 November 2000

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

zbMATH Keywords

dominationspanning treesinterpolating function

Mathematics Subject Classification ID

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

Related Items (1)

On an interpolation property of outerplanar graphs

Cites Work

• Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
• Chordal graphs and upper irredundance, upper domination and independence
• Relations between packing and covering numbers of a tree
• Interpolation theorem for diameters of spanning trees
• Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
• Maximum versus minimum invariants for graphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Total domination in graphs
• Interpolation theorem for the number of end‐vertices of spanning trees
• Properties of Hereditary Hypergraphs and Middle Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Interpolation theorems for domination numbers of a graph