On local antimagic total labeling of complete graphs amalgamation
- 1 January 2023
- journal article
- research article
- Published by AGH University Press in Opuscula Mathematica
- Vol. 43 (3) , 429-453
Abstract
Let \(G = (V,E)\) be a connected simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling. A bijection \(g : E \to \{1,2,\ldots,q\}\) is called a local antimagic labeling of $ if for any two adjacent vertices \(u\) and \(v\), we have \(g^+(u) \ne g^+(v)\), where \(g^+(u) = \sum_{e\in E(u)} g(e)\), and \(E(u)\) is the set of edges incident to \(u\). Similarly, a bijection \(f:V(G)\cup E(G)\to \{1,2,\ldots,p+q\}\) is called a local antimagic total labeling of \(G\) if for any two adjacent vertices \(u\) and \(v\), we have \(w_f(u)\ne w_f(v)\), where \(w_f(u) = f(u) + \sum_{e\in E(u)} f(e)\). Thus, any local antimagic (total) labeling induces a proper vertex coloring of \(G\) if vertex \(v\) is assigned the color \(g^+(v)\) (respectively, \(w_f(u)\)). The local antimagic (total) chromatic number, denoted \(\chi_{la}(G)\) (respectively \(\chi_{lat}(G)\)), is the minimum number of induced colors taken over local antimagic (total) labeling of \(G\). In this paper, we determined \(\chi_{lat}(G)\) where \(G\) is the amalgamation ofcomplete graphs. Consequently, we also obtained the local antimagic (total) chromatic number of the disjoint union of complete graphs, and the join of \(K_1\) and amalgamation of complete graphs under various conditions. An application of local antimagic total chromatic number is also given.
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Approaches that output infinitely many graphs with small local antimagic chromatic numberDiscrete Mathematics, Algorithms and Applications, 2022
- On local antimagic chromatic number of spider graphsJournal of Discrete Mathematical Sciences and Cryptography, 2022
- On local antimagic chromatic number of cycle-related join graphsDiscussiones Mathematicae Graph Theory, 2021
- Local antimagic chromatic number of trees - IJournal of Discrete Mathematical Sciences and Cryptography, 2020
- Affirmative Solutions on Local Antimagic Chromatic NumberGraphs and Combinatorics, 2020
- Proof of a local antimagic conjectureDiscrete Mathematics & Theoretical Computer Science, 2018
- On a combination of the 1-2-3 Conjecture and the Antimagic Labelling ConjectureDiscrete Mathematics & Theoretical Computer Science, 2017
- Local Antimagic Vertex Coloring of a GraphGraphs and Combinatorics, 2017
- Magic rectangles revisitedDiscrete Mathematics, 1999
- Graph Theory with Applications1976