|
|
|
|
WATCHING SYSTEMS OF TRIANGULAR GRAPHS
|
|
|
|
|
|
|
|
نویسنده
|
روزبیانی مریم ,میمنی حمیدرضا ,تهرانیان ابوالفضل
|
|
منبع
|
transactions on combinatorics - 2014 - دوره : 3 - شماره : 1 - صفحه:51 -57
|
|
چکیده
|
A watching system in a graph g = (v;e) is a set w = f!1; !2; : : : ; !kg, where !i =(vi;zi); vi 2 v and zi is a subset of closed neighborhood of vi such that the sets lw(v) = f!i : v 2 zigare non-empty and distinct, for any v 2 v . in this paper, we study the watching systems of line graphkn which is called triangular graph and denoted by t(n). the minimum size of a watching system ofg is denoted by !(g). we show that !(t(n)) = d2n3 e.
|
|
کلیدواژه
|
Identifying code ,Watching system ,Triangular graph
|
|
آدرس
|
islamic azad university, Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran, ایران, shahid rajaee teacher training university, Department of Mathematics, Shahid Rajaee Teacher Training University, Tehran, Iran, ایران, islamic azad university, Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran, ایران
|
|
پست الکترونیکی
|
tehranian1340@yahoo.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|