Upper bounds for \(f\)-domination number of graphs
type: Item
instance of: scholarly article
title: Upper bounds for \(f\)-domination number of graphs
zbMATH Open document ID: 0955.05077
DOI: 10.1016/S0012-365X(97)00204-5
author: Beifang Chen
author: Sanming Zhou
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1524847
zbMATH Keywords: \(f\)-domination number
MaRDI profile type: Publication
cites work: A note on the k-domination number of a graph
cites work: An upper bound for thek-domination number of a graph
cites work: On some extremal problems in graph theory
cites work: Q3691778
cites work: Q3691779
cites work: A new domination conception
cites work: Q4862678
cites work: On $f$-domination number of a graph
full work available at URL: s0012-365x(97)00204-5
OpenAlex ID: W2286649771
description: scientific article; zbMATH DE number 1524847