컨텐츠 시작
학술대회/행사
초록검색
| 제출번호(No.) | 0514 |
|---|---|
| 분류(Section) | Poster Session |
| 분과(Session) | Combinatorics / Graph Theory / Cryptography / Coding Theory (SS-05) |
| 영문제목 (Title(Eng.)) |
[CANCELED] On locating-chromatic number of a non connected graph |
| 저자(Author(s)) |
Des Welyyanti1, Edy Tri Baskoro1, Rinovia Simanjuntak1, Saladin Uttunggadewa1 Institut Teknologi Bandung1 |
| 초록본문(Abstract) | Let $c^{*}$ be a vertex $k$-coloring in a non connected graph $H(V,E)$. Let $\prod = \{C_{1},C_{2},...,C_{k}\}$ be the partition of $V(H)$, where $C_{i}$ is the set of vertices receiving color $i$. \emph{The color code} $c_{\prod}^{*}(v)$ of a vertex $v$ in $H$ is the ordered k-tuple $(d(v,C_{1}),d(v,C_{2}),..., d(v,C_{k}))$, where $d(v,C_{i}) = min \{d(v,x)|x \in C_{i}\}$ and $d(v,C_{i})<\infty$ for $1 \leq i \leq k$. If any two distinct vertices $u,v$ in $H$ satisfy that $c_{\prod}^{*}(u)\neq c_{\prod}^{*}(v)$ then $c^{*}$ is called \emph{ a locating k-coloring} of $H$. \emph{The locating-chromatic number} of $H$, denoted by $\chi_{L}^{*}(H)$, is the smallest $k$ such that $H$ admits a locating-coloring with $k$ colors. If no integer satisfy that conditions, then the locating-chromatic number of $H$ is infinite ($\chi_{L}^{*}=\infty$). Let forest graph, $H=\bigcup_{i=1}^{k}T_{i}$, be a non connected graph which has trees as components. In this paper, we study the locating-chromatic number of $H=\bigcup_{i=1}^{k}T_{i}$ where $T_{i}=K_{1,m}$ and $T_{i}=P_{n_{i}}$. |
| 분류기호 (MSC number(s)) |
05C12, 05C15 |
| 키워드(Keyword(s)) | color code, locating-chromatic number, forest graph |
| 강연 형태 (Language of Session (Talk)) |
English |