Planar graph characterization of γ - Uniquely colorable graphs

Yamuna, M.; Elakkiya, A.

doi:10.1088/1757-899x/263/4/042130

Cited by 4 publications

(4 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Figure 8 G, are planar, G is just excellent. Contracting (4, 5), (6,3), (7,2), we see that 1, 63, 45, 72, 8 is K 5 and hence is non planar. If G is just excellent graph …”

Section: Examplementioning

confidence: 93%

“…Yamuna et al introduced Non domination subdivision stable graphs (NDSS) and characterized planarity of complement of NDSS graphs.. In [6], [7], M. Yamuna et al introduced uniquely colorable graphs and also provided the constructive characterization of  -uniquely colorable trees and characterized planarity of complement of  -uniquely colorable graphs.This paper targets to determine properties of using properties of G without constructing .…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

G, G ̅ Properties – from G ̅, G

Elakkiya¹,

Yamuna²

2018

IJET

View full text Add to dashboard Cite

show abstract

“…In Figure 8 G, are planar, G is just excellent. Contracting (4, 5), (6,3), (7,2), we see that 1, 63, 45, 72, 8 is K 5 and hence is non planar. If G is just excellent graph …”

Section: Examplementioning

confidence: 93%

Section: Introductionmentioning

confidence: 99%

G, G ̅ Properties – from G ̅, G

Elakkiya¹,

Yamuna²

2018

IJET

View full text Add to dashboard Cite

show abstract

“…In [1] Bing Zhou investigated the dominating --color number, d  (G) , of a graph G. In [2], [3], M. Yamuna et al introduced uniquely colorable graphs and also provided the constructive characterization of  -uniquely colorable trees and characterized planarity of complement of  -uniquely colorable graphs. In [4], [5],M.…”

Section: Introductionmentioning

confidence: 99%

Planar and Non Planar Construction of - Uniquely Colorable Graph

Elakkiya

Yamuna

2018

IJET

View full text Add to dashboard Cite

A uniquely colorable graph G whose chromatic partition contains atleast one g - set is termed as a g - uniquely colorable graph. In this paper, we provide necessary and sufficient condition for and G* to be g - uniquely colorable whenever G g- uniquely colorable and also provide constructive characterization to show that whenever G is g- uniquely colorable such that |P | ³ 2, G can be both planarand non planar.

show abstract

“…In [1], [2], M. Yamuna et al introduced  -uniquely colorablegraphs and also provided the constructive characterization of  -uniquely colorable trees. In [3], [4], they have introduced Non domination subdivision stable graphs (NDSS) andcharacterized planarity of complement of NDSS graphs .In [5], M. Yamuna et al have introduced graph domination graph.…”

Section: Introductionmentioning

confidence: 99%