Linear Forest mP 3 Plus a Longer Path P n Becoming Antimagic

Jen-Ling Shang and Fei-Huang Chang
Additional contact information
Jen-Ling Shang: Department of Marketing, Kainan University, Luzhu Dist., Taoyuan City 33857, Taiwan
Fei-Huang Chang: Academy of Preparatory Programs for Overseas Chinese Students, National Taiwan Normal University, Linkou Dist., New Taipei City 24449, Taiwan

Mathematics, 2022, vol. 10, issue 12, 1-9

Abstract: An edge labeling of a graph G is a bijection f from E ( G ) to a set of | E ( G ) | integers. For a vertex u in G , the induced vertex sum of u , denoted by f + ( u ) , is defined as f + ( u ) = ∑ u v ∈ E ( G ) f ( u v ) . Graph G is said to be antimagic if it has an edge labeling g such that g ( E ( G ) ) = { 1 , 2 , ⋯ , | E ( G ) | } and g + ( u ) ≠ g + ( v ) for any pair u , v ∈ V ( G ) with u ≠ v . A linear forest is a union of disjoint paths of orders greater than one. Let m P k denote a linear forest consisting of m disjoint copies of path P k . It is known that m P 3 is antimagic if and only if m = 1 . In this study, we add a disjoint path P n ( n ≥ 4 ) to m P 3 and develop a necessary condition and a sufficient condition whereby the new linear forest m P 3 ⋃ P n may be antimagic.

Keywords: edge labeling; antimagic labeling; antimagic graph; disconnected antimagic graph; linear forest (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/12/2036/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/12/2036/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:12:p:2036-:d:837058

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().