H -Coverings of Path-Amalgamated Ladders and Fans

Yijun Xiong, Huajun Wang, Muhammad Awais Umar, Yu-Ming Chu, Basharat Rehman Ali and Maria Naseem

Mathematical Problems in Engineering, 2020, vol. 2020, 1-7

Abstract:

Let be a connected, simple graph with finite vertices and edges . A family of subgraphs such that for all , , for some is an edge-covering of . If , , then has an - covering. Graph with - covering is an - -antimagic if a bijection exists and the sum over all vertex-weights and edge-weights of forms a set . The labeling is super for and graph is - supermagic for . This manuscript proves results about super - antimagic labeling of path amalgamation of ladders and fans for several differences.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/5846014.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/5846014.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5846014

DOI: 10.1155/2020/5846014

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().