GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS

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)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\) such that \(f(u)\neq f(v)\) for every edge \(uv\in E(G)\)....

全面介紹

書目詳細資料

發表在:	Ural Mathematical Journal
Main Authors:	I Nengah Suparta, Mathiyazhagan Venkatachalam, I Gede Aris Gunadi, Putu Andi Cipta Pratama
格式:	Article
語言:	英语
出版:	Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and Mechanics 2023-12-01
主題:	graceful colouring, graceful chromatics number, cartesian product graph
在線閱讀:	https://umjuran.ru/index.php/umj/article/view/600