Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Characterizing all trees with locating-chromatic number 3

Electronic Journal of Graph Theory and Applications · Vol. 1 No. 2 (2013) · hlm. 109–117

DOI
10.5614/ejgta.2013.1.2.4
ISSN
2338-2287
Terbit
2013-11-13
Penerbit
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa
eng

Abstrak

Let $c$ be a proper $k$-coloring of a connected graph $G$. Let $\Pi = \{S_{1}, S_{2},\ldots, S_{k}\}$ be the induced partition of $V(G)$ by $c$, where $S_{i}$ is the partition class having all vertices with color $i$.The color code $c_{\Pi}(v)$ of vertex $v$ is the ordered$k$-tuple $(d(v,S_{1}), d(v,S_{2}),\ldots, d(v,S_{k}))$, where$d(v,S_{i})= \hbox{min}\{d(v,x)|x \in S_{i}\}$, for $1\leq i\leq k$.If all vertices of $G$ have distinct color codes, then $c$ iscalled a locating-coloring of $G$.The locating-chromatic number of $G$, denoted by $\chi_{L}(G)$, isthe smallest $k$ such that $G$ posses a locating $k$-coloring. Clearly, any graph of order $n \geq 2$ have locating-chromatic number $k$, where $2 \leq k \leq n$. Characterizing all graphswith a certain locating-chromatic number is a difficult problem. Up to now, we have known allgraphs of order $n$ with locating chromatic number $2, n-1,$ or $n$.In this paper, we characterize all trees whose locating-chromatic number $3$. We also give a family of trees with locating-chromatic number 4.

Kata kunci

Jaringan kolaborasi para penulis

18 penulis · 31 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Rinovia; Institut Teknologi Bandung SimanjuntakAfiliasi tidak diketahui2
Shariefuddin; University of Kashmir PirzadaAfiliasi tidak diketahui1
Mir Riyaz; University of Kashmir Ul RashidAfiliasi tidak diketahui1
Amir RehmanAfiliasi tidak diketahui1
Ketut Queena; Institut Teknologi Bandung FredlinaAfiliasi tidak diketahui1
Pritta Etriana; Institut Teknologi Bandung PutriAfiliasi tidak diketahui1
Yusuf; Institut Teknologi Bandung HafidhAfiliasi tidak diketahui1
Devi Imulia Dian; The University of Melbourne PrimaskunAfiliasi tidak diketahui1
Faisal; Institut Teknologi Bandung SusantoAfiliasi tidak diketahui1
Mostafa; Ferdowsi University of Mashhad TavakoliAfiliasi tidak diketahui1
Meysam; Ferdowsi University of Mashhad KorivandAfiliasi tidak diketahui1
Ahmad; Ferdowsi University of Mashhad ErfanianAfiliasi tidak diketahui1
Gholamreza; Ferdowsi University of Mashhad AbrishamiAfiliasi tidak diketahui1
Muhammad; Institut Teknologi Bandung RidwanAfiliasi tidak diketahui1
Hilda; Institut Teknologi Bandung AssiyatunAfiliasi tidak diketahui1
Anak Agung Gede; Universitas Merdeka Malang NgurahAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://www.ejgta.org/index.php/ejgta/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Characterizing all trees with locating-chromatic number 3</dc:title>
	<dc:creator>Baskoro, Edy Tri; Institut Teknologi Bandung</dc:creator>
	<dc:creator>Asmiati, A; Institut Teknologi Bandung</dc:creator>
	<dc:subject xml:lang="en-US">Locating-chromatic number, graph, tree</dc:subject>
	<dc:description xml:lang="en-US">Let $c$ be a proper $k$-coloring of a connected graph $G$.  Let $\Pi = \{S_{1}, S_{2},\ldots, S_{k}\}$ be the induced  partition of $V(G)$ by $c$,  where $S_{i}$ is the partition class having all vertices with color $i$.The color code $c_{\Pi}(v)$ of vertex $v$ is the ordered$k$-tuple $(d(v,S_{1}), d(v,S_{2}),\ldots, d(v,S_{k}))$, where$d(v,S_{i})= \hbox{min}\{d(v,x)|x \in S_{i}\}$, for $1\leq i\leq k$.If all vertices of $G$ have distinct color codes, then $c$ iscalled a locating-coloring of $G$.The locating-chromatic number of $G$, denoted by $\chi_{L}(G)$, isthe smallest $k$ such that $G$ posses a locating $k$-coloring. Clearly, any graph of order $n \geq 2$ have locating-chromatic number $k$, where $2 \leq k \leq n$. Characterizing all graphswith a certain locating-chromatic number is a difficult problem. Up to now, we have known allgraphs of order $n$ with locating chromatic number $2, n-1,$ or $n$.In this paper, we characterize all trees whose locating-chromatic number $3$. We also give a family of trees with locating-chromatic number 4.</dc:description>
	<dc:publisher xml:lang="en-US">GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2013-11-13</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>http://www.ejgta.org/index.php/ejgta/article/view/23</dc:identifier>
	<dc:identifier>10.5614/ejgta.2013.1.2.4</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 1, No 2 (2013): Electronic Journal of Graph Theory and Applications; 109 - 117</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/23/7</dc:relation>
</oai_dc:dc>