2017
DOI: 10.29027/ijirpem.v1.i1.2017.31-38
|View full text |Cite
|
Sign up to set email alerts
|

Quotient-3 Cordial Labeling for Some Special Graphs - Part-II

Abstract: Let G be a graph of order p and size q. Let f: V (G) → Z 4 -{0} be a function. For each E (G) define f*: E (G) → Z 3 by f*(uv) =

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…Quotient labeling of graphs was first introduced by P. Sumathi and A. Rathi [2]. They found the quotient labeling number of various graphs and are found in [3][4][5]. In this paper we found the quotientlabeling number of corona of family of ladder graphs.…”
Section: Introductionmentioning
confidence: 86%
“…Quotient labeling of graphs was first introduced by P. Sumathi and A. Rathi [2]. They found the quotient labeling number of various graphs and are found in [3][4][5]. In this paper we found the quotientlabeling number of corona of family of ladder graphs.…”
Section: Introductionmentioning
confidence: 86%