disproof of two conjectures on proper 2-dominating sets in graphs
|
|
|
|
|
|
|
|
نویسنده
|
chellali mustapha ,volkmann lutz
|
|
منبع
|
communications in combinatorics and optimization - 2026 - دوره : 11 - شماره : 2 - صفحه:713 -715
|
|
چکیده
|
In this note, we disprove two conjectures recently stated on proper $2$-dominating sets in graphs. we recall that a proper $2$-dominating set of a graph $g=(v,e)$ is a subset $d$ of $v$ such that every vertex in $v-d$ has at least two neighbors in $d$ except for at least one vertex which must have exactly two neighbors in $d$.
|
|
کلیدواژه
|
2-dominating sets ,proper 2-dominating sets ,proper 2-domination num-ber.
|
|
آدرس
|
university of blida, lamda-ro laboratory, department of mathematics, algeria, lehrstuhl ii für mathematik, rwth aachen, germany
|
|
پست الکترونیکی
|
volkm@math2.rwth-aachen.de
|
|
|
|
|
|
|