|
|
|
|
Three Bounds For Identifying Code Number
|
|
|
|
|
|
|
|
نویسنده
|
vatandoost e. ,mirasheh k.
|
|
منبع
|
journal of algebra and related topics - 2022 - دوره : 10 - شماره : 2 - صفحه:61 -67
|
|
چکیده
|
Abstract. let g = (v;e) be a simple graph. a set c of vertices g is an identifying set of g if for every two vertices x and y belong to v the sets ng[x]c and ng[y]c are non-empty and di erent. given a graph g; the smallest size of an identifying set of g is called the identifying code number of g and is denoted by id(g): two vertices x and y are twins when ng[x] = ng[y]: graphs with at least two twin vertices are not identiable graphs. in this paper, we present three bounds for identifying code number.
|
|
کلیدواژه
|
code . Strongly . Rayleigh quotient
|
|
آدرس
|
international university imam khomeini, faculty of science, department of pure mathematics, iran, international university, imam khomeini, faculty of science, department of pure mathematics, Iran
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|