Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Prime Graceful Chromatic Number of Diverse Graphs
View through CrossRef
In this paper, prime graceful coloring is introduced which aims to incorporate principles of prime and graceful coloring. The prime graceful coloring of star, path, cycle, friendship, pan and bistar graphs are proposed. This new approach is related to the prime graceful chromatic number which represent the fewest colors needed to color any graph adhering to the principles of prime graceful coloring. Also, the efficiency of new coloring are analyzed with the examples.
Title: Prime Graceful Chromatic Number of Diverse Graphs
Description:
In this paper, prime graceful coloring is introduced which aims to incorporate principles of prime and graceful coloring.
The prime graceful coloring of star, path, cycle, friendship, pan and bistar graphs are proposed.
This new approach is related to the prime graceful chromatic number which represent the fewest colors needed to color any graph adhering to the principles of prime graceful coloring.
Also, the efficiency of new coloring are analyzed with the examples.
Related Results
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Fibonacci Prime Labelling on the Class of Flower Graphs
Fibonacci Prime Labelling on the Class of Flower Graphs
Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numb...
Paley, Cubic Paley, Quadruple Paley, and Generalized Paley Graphs with an Edge-Graceful Labeling
Paley, Cubic Paley, Quadruple Paley, and Generalized Paley Graphs with an Edge-Graceful Labeling
The Paley graph Pq is a simple connected strongly regular graph with (q, q−1/2 , q−5/4 , q−1/4 ) as its parameters, where V (Pq) is the finite field Fq of order q = pn, p is an odd...
Effect of chromatic aberration on performance of concentrated multi-junction solar cells and their optimization
Effect of chromatic aberration on performance of concentrated multi-junction solar cells and their optimization
In order to investigate the influence of the chromatic aberration on the performance of multi-junction solar cells, the performance of the triple-junction GaInP/GaInAs/Ge solar cel...
Planar graphs have bounded nonrepetitive chromatic number
Planar graphs have bounded nonrepetitive chromatic number
The following seemingly simple question with surprisingly many connections to various problems in computer science and mathematics can be traced back to the beginning of the 20th c...
Chromatic Polynomial of Intuitionistic Fuzzy Graphs(IFGs) Using α-Levels
Chromatic Polynomial of Intuitionistic Fuzzy Graphs(IFGs) Using α-Levels
Abstract
Objective: In graph coloring, determining the chromatic polynomial is exactly finding the number of alternative solutions anywhere graph coloring is applied. In th...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...