Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On the Chromatic Number of Cycle Books Graph
View through CrossRef
Graph coloring is a fundamental topic in graph theory, with various applications in scheduling, networking, and optimization problems. In this study, we investigate the chromatic number of the cycle books graph , a structured graph formed by attaching multiple cycles to a common path . We establish that the chromatic number of depends on the parity of . Specifically, we prove that if is even, the chromatic number is , while if is odd, the chromatic number is . These results provide a deeper understanding of coloring properties in book-like graphs and contribute to the broader study of chromatic numbers in structured graph families. The findings may be extended to other variations of book graphs and related topologies in future research.
Title: On the Chromatic Number of Cycle Books Graph
Description:
Graph coloring is a fundamental topic in graph theory, with various applications in scheduling, networking, and optimization problems.
In this study, we investigate the chromatic number of the cycle books graph , a structured graph formed by attaching multiple cycles to a common path .
We establish that the chromatic number of depends on the parity of .
Specifically, we prove that if is even, the chromatic number is , while if is odd, the chromatic number is .
These results provide a deeper understanding of coloring properties in book-like graphs and contribute to the broader study of chromatic numbers in structured graph families.
The findings may be extended to other variations of book graphs and related topologies in future research.
Related Results
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
Let G be a connected and undirected graph. Vertex coloring in a graph G is a mapping from the set of vertices in G to the set of colors such that every two adjacent vertices have d...
Burning, edge burning & chromatic burning classification of some graph family
Burning, edge burning & chromatic burning classification of some graph family
Graph ‘G’ is a Simple and undirected graph, which has a lowest number of color that is required to color the edge is called chromatic index. It is denoted by the symbol χ1(G). In ...
Bilangan Kromatik Lokasi pada Graf Hasil Amalgamasi Sisi dari Graf Bintang dan Graf Lengkap
Bilangan Kromatik Lokasi pada Graf Hasil Amalgamasi Sisi dari Graf Bintang dan Graf Lengkap
The locating coloring of graph extends the vertex coloring dan partition dimension of graph. The minimum number of locating coloring of graph G is called the locating chromatic num...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
The Complexity of Pencil Graph and Line Pencil Graph
The Complexity of Pencil Graph and Line Pencil Graph
Let ???? be a linked and undirected graph. Every linked graph ???? must contain a spanning tree ????, which is a subgraph of ????that is a tree and contain all the nodes of ????. T...
The Locating-Chromatic Number of Origami Graphs
The Locating-Chromatic Number of Origami Graphs
The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k s...
A tight Erdős-Pósa function for planar minors
A tight Erdős-Pósa function for planar minors
Let F be a family of graphs. Then for every graph G the maximum number of disjoint subgraphs of G, each isomorphic to a member of F, is at most the minimum size of a set of vertice...