New Results of Face Labeling for Some Plane Graphs
Nabila Hameed, Gohar Ali, Muhammad Numan and 2 more
IEEE Access · 2019
doi:10.1109/access.2019.2921014 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
A labeling of a plane graph is called super d-antimagic if the vertices receive the smallest labels and the weight set of all faces in an arithematic progression with difference d, where weight of each face is the some of all labels correspond to that face. In this paper, first we construct an upper bound for the paprmeter d. Secondly, we show that if a plane graph G is super d-antimagic then its subdivision is also super d-antimagic. Finally, we show that the Dutch windmill graph exist super d-antimagic labeling for different values of d, s.
Abstract licence: CC BY-NC-ND
References8
8 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.