b-chromatic numberb-dominating setA b-coloring of a graph [Formula: see text] is a proper coloring of the vertices of [Formula: see text] such that there exist a vertex in each color class joined to at least one vertex in each other color classes. The b-chromatic number of a graph ...
On the chromatic number of (P5,dart)-free graphs For a graph [Formula: see text], [Formula: see text], [Formula: see text] represent the clique number and the chromatic number of [Formula: see text], resp... W Xu,X Zhang - 《Discret.math.algorithms Appl》 被引量: 0发表: 2022年...
Pushable chromatic number of graphs with maximum average degree at most [formula omitted] A homomorphism of an oriented graphGto an oriented graphHis an arc preserving vertex mapping. To push a vertexvof an oriented graphGis to reverse the direc... T Das,S Sen - 《Discrete Applied Mathematics...
The smallest number of colours necessary to colour the nodes of agraphso that no two adjacent nodes have the same colour. See also:four colour map theorem. Graph Theory Lessons. Eric Weisstein's World Of Mathematics. The Geometry Center. ...
We consider a natural generalization of the chromatic polynomial of a graph. Let the symbol f ( x 1 , … , x m ) ( H , λ ) denote a number of different λ-colourings of a hypergraph H = ( X , E ), where X = { v 1 , … , v n } and E = { e 1 , … , e m ...
Find a vertex chromatic number of the Petersen graph: In[1]:= Out[1]= Chromatic numbers of the complete graph: In[1]:= Out[1]= The formula: In[2]:= Out[2]= Scope(6) Applications(3) Properties & Relations(8) See
RECURSIVE FORMULA FOR CALCULATING THE CHROMATIC POLYNOMIAL OF A GRAPH BY VERTEX DELETIONGraph Theorychromatic polynomialvertex-deleting recursive formulaA new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only...
2) Equitable chromatic number 均匀色数 1. In this paper,some conditions for which trees are equitably k-colorable are determined;a sufficient and necessary condition and an explicit formula for the equitable chromatic number of trees with diameter 4 are given. 本文得到树可均匀k-着色的一些条件...
Under a Creative Commons license open accessAbstract An equitable coloring of a graph G is a proper vertex coloring of G such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors...
An additional bonus is the fact that the explicit formulae obtained here are well-adapted to the methods of complex function theory, so that results about the locations of the zeros of the polynomials can be deduced. A relatively simple case occurs when we take the base graph to be the ...