Tight upper bounds for the domination numbers of graphs with given order and minimum degree
type: Item
instance of: scholarly article
title: Tight upper bounds for the domination numbers of graphs with given order and minimum degree
zbMATH Open document ID: 0884.05057
author: W. Edwin Clark
author: Larry A. Dunning
published in: The Electronic Journal of Combinatorics
publication date: 1998-02-15T00:00:00Z
full work available at URL: https://eudml.org/doc/119218
full work available at URL: v4i1r26.html
review text: Summary: Let \(\gamma(n,\delta)\) denote the maximum possible domination number of a graph with \(n\) vertices and minimum degree \(\delta\). Using known results we determine \(\gamma(n,\delta)\) for \(\delta=0, 1, 2, 3\), \(n \geq \delta + 1\) and for all \(n\), \(\delta\) where \(\delta = n-k\) and \(n\) is sufficiently large relative to \(k\). We also obtain \(\gamma(n,\delta)\) for all remaining values of \((n,\delta)\) when \(n \leq 14\) and all but 6 values of \((n,\delta)\) when \(n = 15\) or 16.
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1118010
zbMATH Keywords: domination number
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1118010