Abstract

Let G be a graph with the vertex set V(G) and edge set E(G). A function h is a bijective function of domain the union of vertex set and edge set of G and range the natural number {1, 2, 3,… , |V(G)| + |E(G)|. We called the function h as a vertex local antimagic total labeling if for any two adjacent vertices x and x‘, w(x) = w(x’), where w(x) = ∑e∈(x) h(e) + h(x), and E(x) is the set of edges which are incident to x. It is considered to be a proper coloring on vertices of graph G if we assign colour to all vertices with w(x). The minimum number of colors by the vertex local antimagic total labeling of G is called the vertex local antimagic chromatic number, denoted by Xlat(G). We study on the vertex local antimagic total labeling of graphs and determined chromatic number on some corona product graphs, namely corona (G © Cm) where G is isomorphis with path, star, broom, cycle, and sunlet graph.

Highlights

  • Graph is a mathematical object that involves all the vertex and edge

  • We continued the studying about the vertex local antimagic total labeling on some corona product graphs

  • Local Antimagic Total Labeling on Corona Graph In the following theorems, we show the results on vertex coloring of local antimagic total labeling on corona product graphs, G Cm where G isomorphis with path, star, broom, cycle, and sunlet graph

Read more

Summary

Introduction

Graph is a mathematical object that involves all the vertex and edge. Graph consists of two sets, namely the set of vertices (V (G) and the set of edges E(G). The antimagic total labeling of graph G is a bijective function h : {V (G) ∪ E(G)} → A local antimagic edge labeling of graph G is a bijective function h : {E(G)} → {1, 2, 3, .

Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.