Some Upper Bounds Related with Domination Number
For a simple and connected graph G, denote the domination number, the
diameter, and the radius of G as β(G), D(G), and r(G), respectively. In this paper,
we solve two conjectures on the upper bounds of β(G) · D(G) and β(G) + r(G),
which are proposed by the computer system AutoGraphiX. Extremal trees which
attain the upper bounds are also considered.
Key words： Auto GraphiX ; Upper bounds ; Extremal tree ; Domination number
Zhao Gu · Ji-Xiang Meng · Zhao Zhang · Jin E.Wan . Some Upper Bounds Related with Domination Number[J]. Journal of the Operations Research Society of China, 2013 , 1(2) : 217 . DOI: DOI10.1007/s40305-013-0012-0
/
| 〈 |
|
〉 |
