ScholarLens Back to search
2019•Journal of Discrete Mathematical Sciences and CryptographyRequires access

Chromatic number of some families of graphs

Anam Rani, N. Parvathi

Open publisher page 7 citations

Abstract

A k-coloring of a graph is a vertex coloring of G that uses k-colors. The chromatic number χ(G) of a graph G is the minimum number of independent subsets that partition the vertex set of G. Any such minimum partition is called a chromatic partition of V(G). In this paper chromatic number of Sunlet and Bistar families of graphs are found

About this research paper

What this paper is about

A k-coloring of a graph is a vertex coloring of G that uses k-colors. The chromatic number χ(G) of a graph G is the minimum number of independent subsets that partition the vertex set of G. Any such minimum partition is called a chromatic partition of V(G). In this paper chromatic number of Sunlet and Bistar families of graphs are found

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

A k-coloring of a graph is a vertex coloring of G that uses k-colors. The chromatic number χ(G) of a graph G is the minimum number of independent subsets that partition the vertex set of G. Any such minimum partition is called a chromatic partition of V(G). In this paper chromatic number of Sunlet and Bistar families of graphs are found

Key concepts: Combinatorics, Chromatic scale, Mathematics, Partition (number theory), Vertex (graph theory), Windmill graph, Brooks' theorem, Fractional coloring

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Chromatic number of some families of graphs — Research Paper | ScholarLens