Read More
Date: 18-5-2022
1588
Date: 22-7-2016
1885
Date: 8-3-2022
1437
|
The upper domination number of a graph is the maximum size of a minimal dominating set of vertices in .
The (lower) domination number may be similarly defined as the minimum size of a dominating set of vertices in (Burger et al. 1997, Mynhardt and Roux 2020).
The lower irredundance number , lower domination number , lower independence number , upper independence number , upper domination number , and upper irredundance number satsify the chain of inequalities
(Burger et al. 1997).
Burger, A. P.; Cockayne, E. J.; and Mynhardt, C. M. "Domination and Irredundance in the Queens' Graph." Disc. Math. 163, 47-66, 1997.
Cockayne, E. J. and Mynhardt, C. M. "The Sequence of Upper and Lower Domination, Independence and Irredundance Numbers of a Graph." Disc. Math. 122, 89-102, 1993).
Hedetniemi, S. T. and Laskar, R. C. "A. Bibliography on Dominating Sets in Graphs and Some Basic Definitions of Domination Parameters." Disc. Math. 86, 257-277, 1990.
Mynhardt, C. M. and Roux, A. "Irredundance Graphs." 14 Apr. 2020. https://arxiv.org/abs/1812.03382.
|
|
علامات بسيطة في جسدك قد تنذر بمرض "قاتل"
|
|
|
|
|
أول صور ثلاثية الأبعاد للغدة الزعترية البشرية
|
|
|
|
|
مكتبة أمّ البنين النسويّة تصدر العدد 212 من مجلّة رياض الزهراء (عليها السلام)
|
|
|