Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Zero : Jurnal Sains, Matematika, dan Terapan
Fran, Fransiskus
Universitas Tanjungpura
Agriculture, Biological Sciences & Forestry Chemistry Mathematics Physics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Exploring the Metric Chromatic Number of Uniform, Centralized Uniform, and Cycle Uniform Theta Graphs Raventino, Raventino; Fran, Fransiskus
ZERO: Jurnal Sains, Matematika dan Terapan Vol 10, No 1 (2026): Zero: Jurnal Sains Matematika dan Terapan
Publisher : UIN Sumatera Utara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30829/zero.v10i1.27103

Abstract

Metric coloring allows adjacent vertices of a graph to share the same color provided that their associated distance vectors are distinct, leading to the concept of the metric chromatic number. This notion is closely related to problems of vertex distinguishability and resource allocation in network-like structures. In this paper, we present the first exact determination of the metric chromatic number for three families of theta type graphs: uniform theta graphs, centralized uniform theta graphs, and a newly introduced class called the cycle uniform theta graph, obtained by cyclically arranging uniform theta subgraphs. The proposed construction enables an investigation of how cyclic configurations influence metric coloring behavior. Using a constructive metric coloring approach, exact values of the metric chromatic number are obtained. It is shown that the uniform theta graph  and the centralized uniform theta graph  both satisfy  for all positive integers  and . For the cycle uniform theta graph , the metric chromatic number equals  when  and  have the same parity or when  is odd and  is even. In contrast,  when  is even and  is odd. This latter case arises because the longest path in the cyclic structure has odd length, forcing the graph to have chromatic number three. Since the graph is connected and its chromatic number is at most three, this structural constraint directly implies that three colors are also necessary for a valid metric coloring.
Co-Authors Raventino, Raventino