Complete characterization of s-bridge graphs with local antimagic chromatic number 2

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. In this paper, we characterize s-bridge graphs with local antimagic chromatic number 2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…