Просмотреть запись

GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS

Электронный научный архив УРФУ

Информация об архиве | Просмотр оригинала
 
 
Поле Значение
 
Заглавие GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS
 
Автор Suparta, I. N.
Venkathacalam, M.
Gunadi, I. G. A.
Pratama, P. A. C.
 
Тематика GRACEFUL COLOURING
GRACEFUL CHROMATIC NUMBER
CARTESIAN PRODUCT
 
Описание A graph G(V,E) is a system consisting of a finite non empty set of vertices V (G) and a set of edges E(G). A (proper) vertex colouring of G is a function f : V (G) →{1, 2,…,k}, for some positive integer k such that f(u)≠f(v) for every edge uv ∈ E(G). Moreover, if |f(u) - f(v)|≠|f(v) - f(w)| for every adjacent edges uv,vw ∈ E(G), then the function f is called graceful colouring for G. The minimum number k such that f is a graceful colouring for G is called the graceful chromatic number of G. The purpose of this research is to determine graceful chromatic number of Cartesian product graphs Cm×Pn for integers m ≥ 3 and n ≥ 2, and Cm × Cn for integers m,n ≥ 3. Here, Cm and Pm are cycle and path with m vertices, respectively. We found some exact values and bounds for graceful chromatic number of these mentioned Cartesian product graphs.
His work was supported by LP2M of Universitas Pendidikan Ganesha.
 
Дата 2024-02-14T05:20:43Z
2024-02-14T05:20:43Z
2023
 
Тип Article
Journal article (info:eu-repo/semantics/article)
Published version (info:eu-repo/semantics/publishedVersion)
 
Идентификатор GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS / I. N. Suparta, M. Venkathacalam, I. G. A. Gunadi, P. A. C. Pratama. — Text : electronic // Ural Mathematical Journal. — 2023. — Volume 9. — № 2. — P. 193-208.
2414-3952
https://umjuran.ru/index.php/umj/article/view/600
http://elar.urfu.ru/handle/10995/129428
59690672
10.15826/umj.2023.2.016
 
Язык en
 
Связанные ресурсы Ural Mathematical Journal. 2023. Volume 9. № 2
 
Права Creative Commons Attribution License
https://creativecommons.org/licenses/by/4.0/
 
Формат application/pdf