Note on edge irregular reflexive labelings of graphs
Martin Bača, Muhammad Irfan, Joe Ryan and 2 more
AKCE International Journal of Graphs and Combinatorics · 2019
doi:10.1016/j.akcej.2018.01.013 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
For a graph, an edge labeling and a vertex labeling are called total -labeling, where. The total -labeling is called an edge irregular reflexive -labeling of the graph, if for every two different edges and of, one has The minimum for which the graph has an edge irregular reflexive -labeling is called the reflexive edge strength of. In this paper we determine the exact value of the reflexive edge strength for cycles, Cartesian product of two cycles and for join graphs of the path and cycle with.
Abstract licence: CC BY-NC-ND
References9
9 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.