Claim Missing Document
Check
Articles

Found 2 Documents
Search

Characterization of \mathcal{R}(2K_2,F_n) with Minimum Order for Small n Fajri, Muhammad Rafif; Assiyatun, Hilda; Baskoro, Edy Tri
Journal of the Indonesian Mathematical Society Vol. 31 No. 2 (2025): JUNE
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.v31i2.1871

Abstract

A Fan graph $F_n$ is defined as the graph $P_n+K_1$, where $P_n$ is the path on $n$ vertices. The notation $F \rightarrow (G, H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red edges contains a graph $G$ or the subgraph of $F$ induced by all blue edges contains a graph $H.$ Let $\mathcal{R}(G, H)$ denote the set of all graphs $F$ satisfying $F \rightarrow (G, H)$ and for every $e \in E(F),$ $(F - e) \not\rightarrow (G, H).$ In this paper, we propose some properties for a graph $G$ of minimum order that belongs to $\mathcal{R}(2K_2,F_n),$ for $n \geq 3$. We have also found all members of $\mathcal{R}(2K_2,F_n)$ with a minimum order for $n \in [3,7]$.
ON THE LOCATING CHROMATIC NUMBER OF DISJOINT UNION OF BUCKMINSTERFULLERENE GRAPHS Zulkarnain, Debi; Yulianti, Lyra; Welyyanti, Des; Mardimar, Kiki Khaira; Fajri, Muhammad Rafif
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 18 No 2 (2024): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol18iss2pp0915-0922

Abstract

Let be a connected non-trivial graph. Let c be a proper vertex-coloring using k colors, namely . Let be a partition of induced by , where is the color class that receives the color . The color code, denoted by , is defined as , where for , and is the distance between two vertices and in G. If all vertices in have different color codes, then is called as the locating-chromatic -coloring of . The locating-chromatic number of , denoted by , is the minimum such that has a locating coloring. Let be the Buckminsterfullerene graph on vertices. Buckminsterfullerene graph is a 3-connected planar graph and a member of the fullerene graphs, representing fullerene molecules in chemistry. In this paper, we determine the locating chromatic number of the disjoint union of Buckminsterfullerene graphs, denoted by .