Stacked book graphs are cycle-antimagic

Stacked book graphs are cycle-antimagic

A family of subgraphs of a finite, simple and connected graph $G$ is called an <em>edge covering</em> of $G$ if every edge of graph $G$ belongs to at least one of the subgraphs. In this manuscript, we define the edge covering of a stacked book graph and its uniform subdivision by cycles...

Full description

Bibliographic Details
Main Authors: Xinqiang Ma, Muhammad Awais Umar, Saima Nazeer, Yu-Ming Chu, Youyuan Liu
Format: Article
Language:English
Published: AIMS Press 2020-07-01
Series:AIMS Mathematics
Subjects:
book graph
stacked book graph $sb_{(p
q)}$
$r$ subdivided stacked book graph $sb_{(p
q)}(r)$
super $(\alpha
d)$-$c_4$-antimagic labeling
d)$-$c_{4(r+1)}$-antimagic labeling
Online Access:https://www.aimspress.com/article/10.3934/math.2020387/fulltext.html

Internet

https://www.aimspress.com/article/10.3934/math.2020387/fulltext.html

Similar Items