Some New Results on Lucky Labeling
Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A gr...
Main Authors: | J. Ashwini, S.Pethanachi Selvam, R.B. Gnanajothi |
---|---|
Format: | Article |
Language: | Arabic |
Published: |
College of Science for Women, University of Baghdad
2023-03-01
|
Series: | Baghdad Science Journal |
Subjects: | |
Online Access: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/8569 |
Similar Items
-
Totally magic d-lucky number of graphs
by: N Mohamed Rilwan, et al.
Published: (2022-12-01) -
Completely independent spanning trees in some Cartesian product graphs
by: Xia Hong, et al.
Published: (2023-05-01) -
Some Properties of the Nil-Graphs of Ideals of Commutative Rings
by: Reza Nikandish
Published: (2022-12-01) -
Some classes of bipartite graphs induced by Gray codes
by: I Nengah Suparta
Published: (2017-10-01) -
AIRC: Attentive Implicit Relation Recommendation Incorporating Content Information for Bipartite Graphs
by: Xintao Ma, et al.
Published: (2020-11-01)