Chromatic Number
The b-chromatic number of some degree splitting graphs
... In this paper we deal with finite, connected and undirected graph G = ( V ( G ) , E ( G )) without loops and multiple edges. The notations and terminology here are used in the sense of Clark and Holton [1]. A proper ...
5
Dominator Chromatic Number of Middle and Total Graphs
... A proper coloring of a graph G is an assignment of colors to the vertices of G in such a way that no two adjacent vertices receive the same color. The chromatic number (G), is the minimum number of ...
5
Game Chromatic Number of Some Regular Graphs
... game chromatic number are χ ( ) G ≤ χ g ( ) G ≤ ∆ ( ) G + 1 , ...game chromatic number of tree graphs and proved that χ g ( ) T ≤ 4 ...game chromatic number of cartesian product ...
6
Chromatic number of graphs with special distance sets, I
... Erdos et al in [5] have proved that χ(G(Z, {2, 3, 5})) = 4 and hence χ(G( Z , P )) = 4. So we can allocate the subsets D of P to four classes, according as G(Z, D) has chromatic number 1,2,3 or 4. Obviously ...
26
Total Dominator Chromatic Number of Grid Graphs
... dominator chromatic number of G is denoted by (G) and is defined by the minimum number of col- ors needed in a total dominator coloring of ...dominator chromatic number of grid ...
8
Improved Bounds for Radio Chromatic Number of Hypercube
... A number of graph coloring problems have their roots in a communication problem known as the channel assignment ...k-chromatic number of hypercube Q n , and an improvement of their lower bound was ...
8
AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS
... In our day to day life many problems on optimization, network designing, scheduling problems, timetabling and so on are related to edge coloring. In general, such problems are NP-complete and it is NP-Hard to decide the ...
10
ON STAR CHROMATIC NUMBER OF PRISM GRAPH FAMILIES
... star chromatic number of different families of graphs such as trees, cycles, complete bipartite graphs, outerplanar graphs and 2-dimensional ...star chromatic number of other families of ...
6
SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH
... total chromatic number of a graph is the smallest positive integer for which the graph admits a total ...total chromatic number of a ...
5
The edge chromatic number of \(\Gamma_{I}(R)\)
... {x ∈ R − I : xy ∈ I for some y ∈ R − I}, where distinct vertices x and y are adjacent if and only if xy ∈ I. It was introduced by S. P. Redmond [14]. In [14], he found the values of parameters such as connectivity, ...
12
Total Dominator Chromatic Number on Various Classes of Graphs
... smallest number of colors for which there exist a smarandachely k-dominator coloring of G is called the smarandachely k- dominator chromatic number of G, and is denoted by χ ...
9
Comparison of Efficient Domination Number with Domination Number, Roman Domination Number and Chromatic Number of a Graph
... domination number of a graph, denoted F(G), is the maximum number of vertices that can be dominated by a set S that dominates each vertex at most ...The chromatic number χ(G) of G is the ...
8
The fractional chromatic number of triangle free subcubic graphs
... the chromatic number of certain graphs, one may notice colourings which are best possible (in that they use as few colours as possible) but which are in some sense ...
61
THE DOM-CHROMATIC NUMBER OF A GRAPH
... A coloring of a graph G is an assignment of colors to its vertices. So, that no two adjacent vertices have the same color. The set of all vertices with any one color is independent and is called a color class. An ...
7
RELATION BETWEEN CHROMATIC, DOMINATOR, DOMINATOR CHROMATIC NUMBER OF MIDDLE GRAPH OF SOME SPECIAL GRAPH
... domination number, chromatic number and domination coloring number, for our ...domination number, chromatic number and domination coloring number of middle graph of ...
8
The incidence chromatic number of some graph
... incidence chromatic number for complete k-partite ...incidence chromatic number of complete k-partite graphs, and also give the incidence chromatic number of three infinite ...
An Alternate C++ Programme for Total Dominator Chromatic Number of Paths and Cycles
... dominator chromatic number of paths and cycles by using C++ programme by removing the corresponding rows and columns of the repeated colors from the adjacency ...
18
Efficient Domination number and Chromatic number of a Fuzzy Graph
... domination number and is denoted by (G). The minimum number of colours required to colour all the vertices such that adjacent vertices do not receive the same colour is the chromatic number ...
6
Total Domination Number and Chromatic Number of a Fuzzy Graph
... number of colours required to colour all the vertices such that adjacent vertices do not receive the same colour is the chromatic number (G). For any graph G a complete sub graph of G is called a ...
5
The packing chromatic number of the infinite square lattice is between 13 and 15
... packing chromatic number of the infinite triangular lattice is infinite [7], though the packing chromatic number of the infinite hexagonal lattice is 7 ...
13