Abstract
An edge labeling of a connected graph is said to be local antimagic if it is a bijection such that for any pair of adjacent vertices and , , where the induced vertex label , with ranging over all the edges incident to . The local antimagic chromatic number of , denoted by , is the minimum number of distinct induced vertex labels over all local antimagic labelings of . Let be the chromatic number of . In this paper, sharp upper and lower bounds of for with pendant vertices, and sufficient conditions for the bounds to equal, are obtained. Consequently, for , there are infinitely many graphs with pendant vertices and . We conjecture that every tree , other than certain caterpillars, spiders and lobsters, with pendant vertices has .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.