Analysing the Time Complexity of Geo Coloring Algorithm of Tree Graph Families
Palestine Journal of Mathematics, cilt.15, sa.Special Issue II, ss.172-180, 2026 (Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 15 Sayı: Special Issue II
- Basım Tarihi: 2026
- Dergi Adı: Palestine Journal of Mathematics
- Derginin Tarandığı İndeksler: Scopus
- Sayfa Sayıları: ss.172-180
- Anahtar Kelimeler: Chromatic number, Geo chromatic number, Geodetic number, Total geo chromatic number
- Bursa Uludağ Üniversitesi Adresli: Evet
Özet
A set Sc of vertices in G that is both geodetic and chromatic set is referred to as geo chromatic set and the minimum cardinality among all geo chromatic sets is called the geo chromatic number of G denoted by χgc (G). A total geo chromatic set Sc of vertices in G is defined as a geo chromatic set and the subgraph it induces has no isolated vertices. The total geo chromatic number is the minimum cardinality of the set Sc which is denoted by χtg (G). In this paper, we determine geo chromatic and total geo chromatic number of tree graph families such as centipede graph cpn, m-star graph Sm,n, bistar graph Bm,n, banana tree graph BTm,n and firecracker graph Fm,n and constructed an algorithm to find geo chromatic number and total geo chromatic number.