On number of pendants in local antimagic chromatic number
- 23 June 2021
- journal article
- research article
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 25 (8) , 2673-2682
Abstract
An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E → {1, … ,|E|} such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y), where the induced vertex label f+(x) = ∑f(e), with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by χla(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. Let χ(G) be the chromatic number of G. In this paper, sharp upper and lower bounds of χla(G) for G with pendant vertices, and sufficient conditions for the bounds to equal, are obtained. Consequently, for k ≥ 1, there are infinitely many graphs with k ≥ χ(G) - 1 pendant vertices and χla(G) = k + 1. The work of this paper leads to conjecture and problem on graphs with pendant(s).Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- On local antimagic chromatic number of cycle-related join graphsDiscussiones Mathematicae Graph Theory, 2021
- Affirmative Solutions on Local Antimagic Chromatic NumberGraphs and Combinatorics, 2020
- Chromatic number of some families of graphsJournal of Discrete Mathematical Sciences and Cryptography, 2019
- More on the total dominator chromatic number of a graphJournal of Information and Optimization Sciences, 2019
- Local antimagic vertex coloring of unicyclic graphsIndonesian Journal of Combinatorics, 2018
- Local Antimagic Vertex Coloring of a GraphGraphs and Combinatorics, 2017