AU - Kumar, A.
AU - Mohankumar, E.
TI - Uniform Number of a Graph
PT - JOURNAL ARTICLE
TA - IJMSI
JN - IJMSI
VO - 15
VI - 2
IP - 2
4099 - http://ijmsi.ir/article-1-1144-en.html
4100 - http://ijmsi.ir/article-1-1144-en.pdf
SO - IJMSI 2
ABĀ - We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ is power set of $X = {D(x_i, x_j): x_i neq x_j}.$ We obtain some basic results and compute the newly introduced graph parameter for some specific graphs.
CP - IRAN
IN - Department of Mathematics, Amrita School of Engineering Coimbatore..
LG - eng
PB - IJMSI
PG - 77
PT - Research paper
YR - 2020