- Title
- Constructions of H-antimagic graphs using smaller edge-antimagic graphs
- Creator
- Dafik; Slamin; Tanna, Dushyant; Semaničová-Feňovčíková, Andrea; Bača, Martin
- Relation
- ARS Combinatoria Vol. 133, Issue July, p. 233-245
- Relation
- http://www.combinatorialmath.ca/ArsCombinatoria/Vol133.html
- Publisher
- Charles Babbage Research Centre
- Resource Type
- journal article
- Date
- 2017
- Description
- A simple graph G = (V, E) admits an H-Covering if every edge in E belongs at least to one subgraph of G isomorphic to a given graph H. An (a, d)-H-antimagic labeling of G admitting an H-covering is a bijective function f : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} such that, for all subgraphs H' of G isomorphic to H, the H'-weights, etf(H') = Συ∈V(H')f(υ)+Σe∈E(H')F(e), constitute an arithmetic progression with the initial term a and the common difference d. Such a labeling is called super if f(V) = {1, 2, ..., ∣V∣}. In this paper, we study the existence of super (a, d)-H-antimagic labelings for graph operation GH, where G is a (super) (b, d*)-edge-antimagic total graph and H is a connected graph of order at least 3.
- Subject
- H-covering; (super) (a, d)-H-antimagic labeling
- Identifier
- http://hdl.handle.net/1959.13/1401506
- Identifier
- uon:34916
- Identifier
- ISSN:0381-7032
- Language
- eng
- Reviewed
- Hits: 3009
- Visitors: 3091
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|