|
|
|
|
BOUNDING THE DOMINATION NUMBER OF A TREE IN TERMS OF ITS ANNIHILATION NUMBER
|
|
|
|
|
|
|
|
نویسنده
|
دهگردی نسرین ,نوروزیان س. ,شیخ الاسلامی س. م.
|
|
منبع
|
transactions on combinatorics - 2013 - دوره : 2 - شماره : 1 - صفحه:9 -16
|
|
چکیده
|
A set s of vertices in a graph g is a dominating set if every vertex of v - s is adjacentto some vertex in s. the domination number (g) is the minimum cardinality of a dominating set ing. the annihilation number a(g) is the largest integer k such that the sum of the first k terms of thenon-decreasing degree sequence of g is at most the number of edges in g. in this paper, we show thatfor any tree t of order n 2, (t) 3a(t)+24 , and we characterize the trees achieving this bound.
|
|
کلیدواژه
|
annihilation number ,dominating set ,domination number
|
|
آدرس
|
azarbaijan shahid madani university, Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I R Iran, ایران, azarbaijan shahid madani university, Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I R Iran, ایران, azarbaijan shahid madani university, Department of Mathematics, Research Group of Processing and Communication Azarbaijan Shahid Madani University, Tabriz, I R Iran, ایران
|
|
پست الکترونیکی
|
s.m.sheikholeslami@azaruniv.edu
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|