Interpolation theorems for domination numbers of a graph
type: Item
instance of: scholarly article
title: Interpolation theorems for domination numbers of a graph
zbMATH Open document ID: 0958.05103
DOI: 10.1016/S0012-365X(98)00108-3
author: Jerzy Topp
author: Preben Dahl Vestergaard
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1524993
zbMATH Keywords: interpolating function
zbMATH Keywords: spanning trees
zbMATH Keywords: domination
MaRDI profile type: Publication
cites work: Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
cites work: Q4304344
cites work: The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
cites work: Q3818315
cites work: Total domination in graphs
cites work: Properties of Hereditary Hypergraphs and Middle Graphs
cites work: Q3829583
cites work: Q3222876
cites work: Q3691778
cites work: Maximum versus minimum invariants for graphs
cites work: Interpolation theorem for diameters of spanning trees
cites work: Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
cites work: Q3828017
cites work: Q4729803
cites work: Q3783327
cites work: Chordal graphs and upper irredundance, upper domination and independence
cites work: Q3880849
cites work: Relations between packing and covering numbers of a tree
cites work: Q3353057
cites work: Interpolation theorem for the number of end‐vertices of spanning trees
cites work: Q4847233
description: scientific article; zbMATH DE number 1524993