EUVIMEDEUVIMED entdecken
Open Access · CC BY-SA 4.0

Exploring the Metric Chromatic Number of Uniform, Centralized Uniform, and Cycle Uniform Theta Graphs

Raventino Raventino, Fransiskus Fran

ZERO: Jurnal Sains, Matematika dan Terapan · 29.01.2026 · 10 (1) · 12

DOI: 10.30829/zero.v10i1.27103 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ZERO: Jurnal Sains, Matematika dan Terapan, online erschienen am 29.01.2026. Verfasst von Raventino Raventino und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Raventino, R., & Fran, F. (2026). Exploring the Metric Chromatic Number of Uniform, Centralized Uniform, and Cycle Uniform Theta Graphs. ZERO: Jurnal Sains, Matematika dan Terapan, 10(1), 12. https://doi.org/10.30829/zero.v10i1.27103

Vancouver

Raventino R, Fran F. Exploring the Metric Chromatic Number of Uniform, Centralized Uniform, and Cycle Uniform Theta Graphs. ZERO: Jurnal Sains, Matematika dan Terapan. 2026;10(1):12. doi:10.30829/zero.v10i1.27103

BibTeX
@article{Raventino2026,
  author = {Raventino, Raventino and Fran, Fransiskus},
  title = {Exploring the Metric Chromatic Number of Uniform, Centralized Uniform, and Cycle Uniform Theta Graphs},
  journal = {ZERO: Jurnal Sains, Matematika dan Terapan},
  year = {2026},
  volume = {10},
  number = {1},
  pages = {12},
  doi = {10.30829/zero.v10i1.27103}
}
Kostenlos starten →