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$...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Yi Hu, Muhammad Awais Umar, Mustafa Habib, Ce Shi, Ghulam Rasool, Zijiang Zhu
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	IEEE 2019-01-01
Edice:	IEEE Access
Témata:	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
On-line přístup:	https://ieeexplore.ieee.org/document/8880653/
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!