๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Relations between the lower domination parameters and the chromatic number of a graph

โœ Scribed by Mustapha Chellali; Lutz Volkmann

Book ID
108315884
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
205 KB
Volume
274
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The difference between the domination nu
The difference between the domination number and the minus domination number of a cubic graph
โœ Xiaofan Yang; Qibin Hou; Xiangsheng Huang; Hengnong Xuan ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 325 KB

The closed neighborhood of a vertex subset S of a graph G = (V,E), denoted as N[Sj, is defined ss the union of S and the set of all the vertices adjacent to some vertex of S. A dominating set of a graph G = (V, E) is defined as a set S of vertices such that N[q = V. The domination number of a graph

Some upper bounds for the product of the
Some upper bounds for the product of the domination number and the chromatic number of a graph
โœ Jerzy Topp; Lutz Volkmann ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 199 KB

Topp, J. and L. Volkmann, Some upper bounds for the product of the domination number and the chromatic number of a graph, Discrete Mathematics 118 (1993) 2899292. Some new upper bounds for yx are proved, where y is the domination number and x is the chromatic number of a graph. All graphs consider