2012
DOI: 10.1016/j.ipl.2011.11.002
|View full text |Cite
|
Sign up to set email alerts
|

Computation of lucky number of planar graphs is NP-hard

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
22
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(22 citation statements)
references
References 6 publications
0
22
0
Order By: Relevance
“…Several types of labeling were introduced and studied for different types of graphs. The concept of Lucky labeling of graphs were studied by A. Ahadi et al [1] and S. Akbari et al [2]. Lucky number for different kinds of graphs has been studied.…”
Section: Introductionmentioning
confidence: 99%
“…Several types of labeling were introduced and studied for different types of graphs. The concept of Lucky labeling of graphs were studied by A. Ahadi et al [1] and S. Akbari et al [2]. Lucky number for different kinds of graphs has been studied.…”
Section: Introductionmentioning
confidence: 99%
“…Lucky labeling of graphs were studied in recent times by A. Ahai et al [8] and S. Akbari et al [9]. Lucky labeling is applied in real life situations such as transportation network, where pair wise connections are given some numerical values.…”
Section: Introductionmentioning
confidence: 99%
“…Graph coloring is used in various research areas of computer science such as networking, image segmentation, clustering, image capturing and data mining. The lucky labeling of graphs were studied by A. Ahai et al [2] and S. Akbari et al [3]. Suppose the vertices of a graph were labeled arbitrarily by positive integers and let s denote the sum of labels over all neighbours of vertex .…”
Section: Introductionmentioning
confidence: 99%