On local antimagic total labeling of complete graphs amalgamation

DOI10.7494/OPMATH.2023.43.3.429zbMATH Open1518.05165arXiv2203.06337MaRDI QIDQ6155782FDOQ6155782

Authors: Gee-Choon Lau, Wai Chee Shiu 

Publication date: 7 June 2023

Published in: Opuscula Mathematica (Search for Journal in Brave)

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:Eo1,2,ldots,q$ is called a local antimagic labeling of $G$ if for any two adjacent vertices $u$ and $v$, we have $g^{+}(u)e{g}^{+}(v)$, where $g^{+}(u)=su{m}_{einE(u)}g(e)$, and $E(u)$ is the set of edges incident to $u$. Similarly, a bijection $f:V(G)cupE(G)o1,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)e{w}_f(v)$, where $w_f(u)=f(u)+su{m}_{einE(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 $ch{i}_{la}(G)$ (respectively $ch{i}_{lat}(G)$), is the minimum number of induced colors taken over local antimagic (total) labeling of $G$. In this paper, we determined $ch{i}_{lat}(G)$ where $G$ is the amalgamation of complete graphs.

Full work available at URL: https://arxiv.org/abs/2203.06337

Recommendations

• Local antimagic labeling of graphs
• Every graph is local antimagic total and its applications
• Vertex-antimagic total labelings of graphs
• On antimagic total labeling of some families of graphs.
• Totally antimagic total labeling of complete bipartite graphs
• On local antimagic chromatic number of graphs
• A generalized version of a local antimagic labelling conjecture
• On antimagic labelings of disjoint union of complete \(s\)-partite graphs
• On \((a,d)\)-antimagic labelling of graphs

zbMATH Keywords

amalgamationcomplete graphslocal antimagic (total) chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Linear degree extractors and the inapproximability of max clique and chromatic number
• Graph theory with applications
• Magic rectangles revisited
• Title not available (Why is that?)
• Local antimagic vertex coloring of a graph
• On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture
• Proof of a local antimagic conjecture
• On local antimagic chromatic number of cycle-related join graphs
• Affirmative solutions on local antimagic chromatic number
• Local antimagic chromatic number of trees - I
• Approaches that output infinitely many graphs with small local antimagic chromatic number

Cited In (1)

• Every graph is local antimagic total and its applications

This page was built for publication: On local antimagic total labeling of complete graphs amalgamation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155782)