Local antimagic labelling for trees

Let G(V, E) be a graph, where V and E are the vertex set and edge set, respectively.A local antimagic labelling of G is a bijection f : E {1, 2, . . ., |E|} such that for every edge uv E, the condition eI(u) f (e) = eI(v) f (e) holds, where I(u) represents the set of edges incident to u. Bensmail

Authors

Institutions

Publication Details

Journal
Contributions to Mathematics
Published
2025-04-14
DOI
https://doi.org/10.47443/cm.2025.013
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Local antimagic labelling for trees

Sanjay Paul, Soumen Raul
Contributions to Mathematics
Graph Labeling and Dimension Problems
article

Local antimagic labelling for trees

Sanjay Paul, Soumen Raul
article en

Abstract

Let G(V, E) be a graph, where V and E are the vertex set and edge set, respectively.A local antimagic labelling of G is a bijection f : E {1, 2, . . ., |E|} such that for every edge uv E, the condition eI(u) f (e) = eI(v) f (e) holds, where I(u) represents the set of edges incident to u. Bensmail

Contributions to MathematicsVol. 11
Indian Institute of Technology Patna (IN)
University Grants Commission
Zero hunger
Openalex Percentile: Top 91%
Graph Labeling and Dimension Problems
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Local antimagic labelling for trees — Sanjay Paul, Soumen Raul · Contributions to Mathematics (2025) | TGRS Research Map | TGRS