Abstract
Proper vertex coloring c of a graph G is a graceful coloring if c is a graceful k-coloring for k∈{1,2,3,…}. Definition graceful k-coloring of a graph G=(V,E) is a proper vertex coloring c:V(G)→{1,2,…,k);k≥2, which induces a proper edge coloring c':E(G)→{1,2,…,k-1} defined c'(uv)=|c(u)-c(v)|. The minimum vertex coloring from graph G can be colored with graceful coloring called a graceful chromatic number with notation χg (G). In this paper, we will investigate the graceful chromatic number of vertex amalgamation of tree graph family with some graph is path graph, centipede graph, broom and E graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.