Autor: |
Xinqiang Ma, Muhammad Awais Umar, Saima Nazeer, Yu-Ming Chu, Youyuan Liu |
Jazyk: |
angličtina |
Rok vydání: |
2020 |
Předmět: |
|
Zdroj: |
AIMS Mathematics, Vol 5, Iss 6, Pp 6043-6050 (2020) |
Druh dokumentu: |
article |
ISSN: |
2473-6988 |
DOI: |
10.3934/math.2020387/fulltext.html |
Popis: |
A family of subgraphs of a finite, simple and connected graph $G$ is called an edge covering 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 of different lengths. If every subgraph of $G$ is isomorphic to one graph $H$ (say) and there is a bijection $\phi:V(G)\cup E(G) \to \{1,2,\dots, |V(G)|+|E(G)| \}$ such that $wt_{\phi}(H)$ forms an arithmetic progression then such a graph is called $(\alpha,d)$-$H$-antimagic. In this paper, we prove super $(\alpha,d)$-cycle-antimagic labelings of stacked book graphs and $r$ subdivided stacked book graph. |
Databáze: |
Directory of Open Access Journals |
Externí odkaz: |
|