Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: local total antimagic

Sortuj według:

Ogranicz wyniki do:

Complete characterization of graphs with local total antimagic chromatic number 3

Lau Gee-Choon

Opuscula Mathematica

2025

Vol. 45, no. 2

199--225

A total labeling of a graph G = (V,E) is said to be local total antimagic if it is a bijection f : V ∪E → {1, . . . , |V |+|E|} such that adjacent vertices, adjacent edges, and pairs of an incident vertex and edge have distinct induced weights where the induced weight of a vertex v is wf (v) = ∑ f(e) with e ranging over all the edges incident to v, and the induced weight of an edge uv is wf (uv) = f(u)+f(v). The local total antimagic chromatic number of G, denoted by χlt(G), is the minimum number of distinct induced vertex and edge weights over all local total antimagic labelings of G. In this paper, we first obtain general lower and upper bounds for χlt(G) and sufficient conditions to construct a graph H with k pendant edges and χlt(H) ∈ {Δ(H) + 1, k + 1}. We then completely characterize graphs G with χlt(G) = 3. Many families of (disconnected) graphs H with k pendant edges and χlt(H) ∈ {Δ(H) + 1, k + 1} are also obtained.