2016
DOI: 10.1016/j.akcej.2016.01.001
|View full text |Cite
|
Sign up to set email alerts
|

Corrigendum to “Properly even harmonious labelings of disconnected graphs” [AKCE Inter. J. Graphs Combin. 12 (2015) 193–203]

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…The concept of vertex equitable labeling was due to Lourdusamy and Seenivasan [3] and further studied in [4][5][6][7]. This is the further extension work on vertex equitable labeling and we prove that the jewel graph J n , jelly fish graph (JF) n , the lobster L(n, 2 …”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The concept of vertex equitable labeling was due to Lourdusamy and Seenivasan [3] and further studied in [4][5][6][7]. This is the further extension work on vertex equitable labeling and we prove that the jewel graph J n , jelly fish graph (JF) n , the lobster L(n, 2 …”
Section: Introductionmentioning
confidence: 99%
“…A graph labeling is an assignment of integers to the vertices or edges or both, subject to certain conditions. There are several types of labeling and a detailed survey of graph labeling can be found in [2]. The vertex set and the edge set of a graph are denoted by V(G) and E(G) respectively.…”
Section: Introductionmentioning
confidence: 99%