Antimagicness of <inline-formula> <tex-math notation="LaTeX">$mC_n$ </tex-math></inline-formula>-Path and Its Disjoint Union

Let M = (V(M), E(M)) be a simple graph with finite vertices and edges. An N-covering of M is a family {N<sub>1</sub>, N<sub>2</sub>, ... , N<sub>&#x03B1;</sub>} of subgraphs of M isomorphic to N such that every edge in E(M) belongs to N<sub>l</sub>...

Full description

Bibliographic Details
Main Authors: Yi Hu, Muhammad Awais Umar, Mustafa Habib, Ce Shi, Ghulam Rasool, Zijiang Zhu
Format: Article
Published: IEEE 2019-01-01
Series:IEEE Access
Online Access: