|
|
|
|
identifying code number of some cayley graphs
|
|
|
|
|
|
|
|
نویسنده
|
ahmadi somayeh ,vatandoost ebrahim ,bahraini ali
|
|
منبع
|
international journal of nonlinear analysis and applications - 2022 - دوره : 13 - شماره : 2 - صفحه:3183 -3189
|
|
چکیده
|
Let γ = (v, e) be a simple graph. a set c of vertices γ is an identifying set of γ if for every two vertices x and y the sets nγ[x] ∩ c and nγ[y] ∩ c are non-empty and different. given a graph γ, the smallest size of an identifying set of γ is called the identifying code number of γ and is denoted by γ id(γ). two vertices x and y are twins when nγ[x] = nγ[y]. graphs with at least two twin vertices are not identifiable graph. in this paper, we study identifying code number of some cayley graphs.
|
|
کلیدواژه
|
domination ,identifying code ,cayley graph
|
|
آدرس
|
imam khomeini international university, department of basic science, iran, imam khomeini international university, department of basic science, iran, islamic azad university, central tehran branch, department of mathematics, iran
|
|
پست الکترونیکی
|
a.bahraini@iauctb.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|