Low and High Vertices in Edge Critical Graphs

Kumar, J. Suresh

doi:10.14445/22315373/ijmtt-v65i4p507

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After Appel and Haken gave a computer verification proof of the Four Color Conjecture, research focus was shifted to coloring that satisfies some specified property [5]. The coloring plays an important role in the combinatorial optimization problems and critical graphs (optimal graphs) are crucial in the Chromatic number Theory [7,8,9,10,11]. Several studies were made in applying graph theory parameters to Roman defense strategy [1,2,3,4,5,6].…”

Section: Introductionmentioning

confidence: 99%

Unique Minimal Proper Roman Coloring of a Graph

Kumar¹

2020

IJRASET

View full text Add to dashboard Cite

Suresh Kumar [12] introduced the notion of Roman Coloring of a graph, G which is an assignment of three colors {0, 1, 2} to the vertices of G such that a vertex with color, 0 must be adjacent to a vertex with color, 2 motivated from the Roman military defense strategy. The Proper coloring version of the Roman Coloring of a graph was introduced and studied by Suresh Kumar and Preethi K Pillai [13]. In this paper, we investigate the graphs having a unique minimal Proper Roman Coloring.

show abstract

Section: Introductionmentioning

confidence: 99%

Unique Minimal Proper Roman Coloring of a Graph

Kumar¹

2020

IJRASET

View full text Add to dashboard Cite

show abstract

Low and High Vertices in Edge Critical Graphs

Cited by 1 publication

References 3 publications

Unique Minimal Proper Roman Coloring of a Graph

Unique Minimal Proper Roman Coloring of a Graph

Contact Info

Product

Resources

About