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

Let <inline-formula> <tex-math notation="LaTeX">$M=(V(M),E(M))$ </tex-math></inline-formula> be a simple graph with finite vertices and edges. An <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula>-<italic>covering</italic> of <inline-formula> <tex-math notation="LaTeX">$M$...

Descrizione completa

Dettagli Bibliografici

Autori principali:	Yi Hu, Muhammad Awais Umar, Mustafa Habib, Ce Shi, Ghulam Rasool, Zijiang Zhu
Natura:	Artigo
Lingua:	Inglês
Pubblicazione:	IEEE 2019-01-01
Serie:	IEEE Access
Soggetti:	Block cut-vertex graph <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">mCₙ</italic>-path disjoint union of <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">mCₙ</italic>-path 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>, <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">d</italic>)-<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
Accesso online:	https://ieeexplore.ieee.org/document/8880653/
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!