ScholarLens Back to search
2017•Zenodo (CERN European Organization for Nuclear Research)Open access

Redundancy Condition of Vertices in Coloring of Graphs

S. Menakadevi, K. Manikandan

Open full text 0 citations

Abstract

In this article we verified the redundant condition X(G) = x(G-v) in coloring of vertices for complete graph, cyclic, simple graph, friendship graph, fan graph, wheel graph, tree and bipartite graphs. These characterizations are verified through examples.

About this research paper

What this paper is about

In this article we verified the redundant condition X(G) = x(G-v) in coloring of vertices for complete graph, cyclic, simple graph, friendship graph, fan graph, wheel graph, tree and bipartite graphs. These characterizations are verified through examples.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this article we verified the redundant condition X(G) = x(G-v) in coloring of vertices for complete graph, cyclic, simple graph, friendship graph, fan graph, wheel graph, tree and bipartite graphs. These characterizations are verified through examples.

Key concepts: Graph coloring, Redundancy (engineering), Computer science, Brooks' theorem, Combinatorics, Mathematics, Chordal graph, Graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Redundancy Condition of Vertices in Coloring of Graphs — Research Paper | ScholarLens