Linear Forest <i>mP</i><sub>3</sub> Plus a Longer Path <i>P</i><sub>n</sub> Becoming Antimagic

Linear Forest <i>mP</i><sub>3</sub> Plus a Longer Path <i>P</i><sub>n</sub> Becoming Antimagic

An edge labeling of a graph <i>G</i> is a bijection <i>f</i> from <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>E</mi><mo stretchy="false">(</mo...

Full description

Bibliographic Details
Main Authors: Jen-Ling Shang, Fei-Huang Chang
Format: Article
Language:English
Published: MDPI AG 2022-06-01
Series:Mathematics
Subjects:
edge labeling
antimagic labeling
antimagic graph
disconnected antimagic graph
linear forest
Online Access:https://www.mdpi.com/2227-7390/10/12/2036

Internet

https://www.mdpi.com/2227-7390/10/12/2036

Similar Items