期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2017
卷号：14
期号：1
页码：42-47
DOI：10.1016/j.akcej.2016.11.004
语种：English
出版社：Elsevier
摘要：Abstract Let H be a graph. A graph G = ( V , E ) admits an H -covering if every edge in E belongs to a subgraph of G isomorphic to H . A graph G admitting an H -covering is called ( a , d ) - H -antimagic if there is a bijection f : V ( G ) ∪ E ( G ) → { 1 , 2 , … , | V ( G ) | + | E ( G ) | } such that for each subgraph H ′ of G isomorphic to H , the sum of labels of all the edges and vertices belonged to H ′ constitute the arithmetic progression with the initial term a and the common difference d . Such a graph is called super if f ( V ( G ) ) = { 1 , 2 , 3 , … , | V ( G ) | } . In this paper, we provide two constructions of (super) H -antimagic graphs obtained from smaller (super) H ′ -antimagic graphs.
关键词：Keywordsen H -covering ( a , d ) - H -antimagic graphSuper ( a , d ) - H -antimagic graphSubdivision of edgesCorona of graphs
