Identifying code in commuting graphs

Identifying code is a graph parameter which is useful in network and robot navigation theory. In this paper, we consider this parameter on commuting graph.For each non-commutative ring R, the commuting graph of R is a graph with vertex set R n Z(R) and two vertices x and y are adjacent if and only if x 6= y and xy = yx.Here we study some algebraic properties of commuting graphs. Also we consider the identi ability of commuting graphs and show that id(

کلیدواژه ها:

Noncommutative ring ، Commuting graph ، Identifying code number