سال انتشار: ۱۳۸۶

محل انتشار: سی و هشتمین کنفرانس ریاضی ایران

تعداد صفحات: ۳

نویسنده(ها):

P FIROOZI –
S.S KARIMIZAD –
S MIRZAMANI –
D.A MOJDEH – Department of Mathematics, University of Mazandaran, Babol, Iran

چکیده:

A graph G is dot-critical if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. If such a graph G has domination number k, we call it k-dot-critical. A graph G is said (y,k)-critical if y(G-S) < (G) for any set S of k vertices and domination number y.
We find a bound for diameter of the circulant graph Cn+1(1,4) are verfied.