domination numbers and diameters in certain graphs
|
|
|
|
|
نویسنده
|
karimizad s. s.
|
منبع
|
journal of linear and topological algebra - 2024 - دوره : 13 - شماره : 2 - صفحه:113 -119
|
چکیده
|
Regarding the problem mentioned by brigham et al. “is it correct that each connected bicritical graph possesses a minimum dominating set having every two appointed vertices of graphs?”, we first give a class of graphs that disprove it and second obtain dominationnumbers and diameters of the graphs of this class. this class of graphs has the property: ω(h) − diam(h) → ∞ when |v(h)| = n → ∞. also, for the bicritical graphs of this class, i(h) = ω(h).
|
کلیدواژه
|
domination number ,bicritical graph ,diameter.
|
آدرس
|
ilam university, faculty of basic sciences, department of mathematics, iran
|
پست الکترونیکی
|
s.karimizad@ilam.ac.ir; s karimizad@yahoo.com
|
|
|
|
|