scientific article; zbMATH DE number 2174617
From MaRDI portal
Publication:4681990
zbMATH Open1067.05052MaRDI QIDQ4681990FDOQ4681990
Authors: Lutz Volkmann 
Publication date: 9 June 2005
Title of this publication is not available (Why is that?)
Recommendations
- Upper bounds for the domination number in graphs of diameter two
- Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree
- scientific article; zbMATH DE number 2235063
- Publication:4489228
- An upper bound on the domination number of a graph.
- scientific article; zbMATH DE number 1750102
- Upper bound on the diameter of a domination dot-critical graph
- Upper bounds for \(f\)-domination number of graphs
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
- Upper bounds on the diameter of domination dot-critical graphs with given connectivity
Cited In (6)
- Upper bound on the diameter of a total domination vertex critical graph.
- An upper bound on the number of edges of a hypergraph with a given diameter
- Domination in graphs of minimum degree at least two and large girth
- A note on domination, girth and minimum degree
- Title not available (Why is that?)
- Domination in bipartite graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4681990)
