2020
DOI: 10.1007/s12652-020-01697-6
|View full text |Cite|
|
Sign up to set email alerts
|

RETRACTED ARTICLE: A study on harmonious chromatic number of total graph of central graph of generalized Petersen graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…The harmonious chromatic number for the central graph, middle graph, and total graph of some families of graphs was studied in various papers: prism graph by Mansuri et al [16]; flower graph, belt graph, rose graph and steering graph by Muthumari and Umamamheswari [20]; snake derived architecture by Selvi [24]; Jahangir graph by Selvi and Azhaguvel [23]; star graph by Rajam and Pauline [22], and double star graph by Vernold et al [26].…”
Section: Previous Results For Harmonious Chromatic Number On Particul...mentioning
confidence: 99%
“…The harmonious chromatic number for the central graph, middle graph, and total graph of some families of graphs was studied in various papers: prism graph by Mansuri et al [16]; flower graph, belt graph, rose graph and steering graph by Muthumari and Umamamheswari [20]; snake derived architecture by Selvi [24]; Jahangir graph by Selvi and Azhaguvel [23]; star graph by Rajam and Pauline [22], and double star graph by Vernold et al [26].…”
Section: Previous Results For Harmonious Chromatic Number On Particul...mentioning
confidence: 99%
“…The Harmonious coloring [5,6,7,9] of a simple graph G is proper vertex coloring in which no any two edges share the same color and minimum number of colors are to be used for harmonious coloring is known as the harmonious chromatic number, denoted by χ H (G). For a graph G = (V, E), subdividing each edge of the given graph G exactly once and joining all the non-adjacent vertices of it is the Central graph [3,7] C(G) of G and the middle graph M (G) [8] is defined in such a way that the vertex set of M (G) is V (G) ∪ E(G) and two vertices x, y of M (G) are adjacent in M (G)) when one of the following holds: (i) x, y are in E(G) and x, y are adjacent in G. (ii) x is in V (G), y is in E(G), and x, y are incident in G and the line Graph [4] of a simple graph G, denoted by L(G) and defined in such a way that there exactly one vertex v(e) in L(G) for each edge e in G and for any two edges e and e in G, L(G) has an edge between v(e) and v(e ), if and only if e and e are incident with the same vertex in G. The (m, n)-tadpole graph [1,2,4]…”
Section: Introductionmentioning
confidence: 99%
“…Later on Mandal et al (2017) discussed genus value of m-polar fuzzy graphs. Recently, Chen et al (2019) investigated an improved spectral graph partition intelligent clustering algorithm for low-power wireless network and most recently Selvi and Amutha (2020) introduced study on harmonious chromatic number of total graph of central graph of generalized Petersen graph.…”
Section: Introductionmentioning
confidence: 99%