On number of pendants in local antimagic chromatic number

preprint2020arXivOpen access

Abstract

An edge labeling of a connected graph G=(V,E)G = (V, E) is said to be local antimagic if it is a bijection f:E→{1,…,∣E∣}f:E \to\{1,\ldots ,|E|\} such that for any pair of adjacent vertices xx and yy, f+(x)≠f+(y)f^+(x)\not= f^+(y), where the induced vertex label f+(x)=∑f(e)f^+(x)= \sum f(e), with ee ranging over all the edges incident to xx. The local antimagic chromatic number of GG, denoted by χla(G)χ_{la}(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of GG. Let χ(G)χ(G) be the chromatic number of GG. In this paper, sharp upper and lower bounds of χla(G)χ_{la}(G) for GG with pendant vertices, and sufficient conditions for the bounds to equal, are obtained. Consequently, for k≥1k\ge 1, there are infinitely many graphs with k≥χ(G)−1k \ge χ(G) - 1 pendant vertices and χla(G)=k+1χ_{la}(G) = k+1. We conjecture that every tree TkT_k, other than certain caterpillars, spiders and lobsters, with k≥1k\ge 1 pendant vertices has χla(Tk)=k+1χ_{la}(T_k) = k+1.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.