Read More
Date: 21-4-2022
2290
Date: 3-3-2022
1760
Date: 20-5-2022
2626
|
The connected domination number of a connected graph , denoted , is the size of a minimum connected dominating set of a graph .
The maximum leaf number and connected domination number of a graph are connected by
where is the vertex count of .
Many families of graphs have simple closed forms, as summarized in the following table. In the table, denotes the floor function.
graph family | connected domination number |
Andrásfai graph | |
Apollonian network | |
antiprism graph | |
barbell graph | 2 |
black bishop graph | |
book graph | 2 |
cocktail party graph | 2 |
complete bipartite graph | |
complete bipartite graph | 2 |
complete graph | 1 |
complete tripartite graph | |
complete tripartite graph | 2 |
-crossed prism graph | |
crown graph | 4 |
cycle graph | |
gear graph | |
helm graph | |
ladder graph | |
Möbius ladder | |
pan graph | |
path graph | |
prism graph | |
rook complement graph | |
rook graph | |
star graph | 1 |
sun graph | |
sunlet graph | |
triangular graph | |
web graph | |
wheel graph | 1 |
white bishop graph |
Sampathkumar, E.; and Walikar, H. B. "The Connected Domination Number of a Graph." J. Math. Phys. Sci. 13, 607-613, 1979.
|
|
علامات بسيطة في جسدك قد تنذر بمرض "قاتل"
|
|
|
|
|
أول صور ثلاثية الأبعاد للغدة الزعترية البشرية
|
|
|
|
|
مكتبة أمّ البنين النسويّة تصدر العدد 212 من مجلّة رياض الزهراء (عليها السلام)
|
|
|