Graceful Chromatic Number of Some Cartesian Product Graphs
I Nengah Suparta,
Mathiyazhagan Venkatachalam,
I Gede Aris Gunadi
et al.
Abstract: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)\). Moreover, if \(|f(u)-f(v)|\neq |f(v)-f(w)|\) for every adjacent edges \(uv,vw\in E(G)\), then the function \(f\) is called graceful colouring for \(G\). The minimum number \(k\) such that \(f\) is a graceful colou… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.