Amalgamations and Cycle-Antimagicness

Amalgamations and Cycle-Antimagicness

A finite simple graph <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula> is called a <inline-formula> <tex-math notation="LaTeX">$(c,d)$ </tex-math></inline-formula>-<inline-formula> <tex-math nota...

Full description

Bibliographic Details
Main Authors: Yijun Xiong, Huajun Wang, Mustafa Habib, Muhammad Awais Umar, Basharat Rehman Ali
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Amalgamation
wheels
fans
flower graphs
<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">H</italic>-covering
(super) <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">C</italic>₃-antimagic labeling
Online Access:https://ieeexplore.ieee.org/document/8809765/

Internet

https://ieeexplore.ieee.org/document/8809765/

Similar Items