Results 91 to 100 of about 8,657,296 (197)
European Journal of Combinatorics, 1997 A new game chromatic number \(\chi^*_g(G)\) of a graph \(G\) is introduced. The authors first show that (i) if \(G\) is a connected bipartite graph with bipartition \((V_1,V_2)\), then \(\chi^*_g(G)= 2\) if and only if \(G\) has a vertex \(v\in V_1\) (say) such that \(N(v)= V_2\); and (ii) \(\chi^*_g(G)= \chi(G)\) (the chromatic number of \(G\)) if \(G\
Guantao Chen +2 more
openaire +3 more sources
THE CHROMATIC NUMBER OF CARTESIAN PRODUCTS
, 2009 This paper studies the Chromatic Number of Cartesian Products and Permutation Graphs. The main results of this paper are for every two graphs G and H, Chromatic Number of Cartesian Product G and H is the maximum of chromatic number Of G and Chromatic ...
A.Sri Krishna Chaitanya +1 more
core +1 more source
Chromatic Number of Resultant of Fuzzy Graphs
Fuzzy Information and Engineering, 2016 Fuzzy graph coloring techniques are used to solve many complex real world problems. The chromatic number of complement of fuzzy graph is obtained and compared with the chromatic number of the corresponding fuzzy graph.
Anjaly Kishore, M.S. Sunitha
doaj +1 more source
Local chromatic number of quadrangulations of surfaces [PDF]
, 2013 The local chromatic number of a graph G, as introduced in [4], is the minimum integer k such that G admits a proper coloring (with an arbitrary number of colors) in which the neighborhood of each vertex uses less than k colors.
Tardos, Gábor +5 more
core +1 more source
Asteroidal Chromatic Number of a Graph
Electronic Notes in Discrete Mathematics, 2003 Summary: Let \(G=(V,E)\) be a connected graph. A subset \(A\) of \(V\) is called an asteroidal set if for any three vertices \(u,v,w\) in \(A\), there exists a \(u\)-\(v\) path in \(G\) that avoids the neighbourhood of \(w\). The asteroidal chromatic number \(\chi_a\) of \(G\) is the minimum order of a partition of \(V\) into asteroidal sets.
S. Arumugam 0001, Hepzibai Jeyakumar
openaire +2 more sources
The 2-Distance Chromatic Number of Some Wheel Related Graphs
, 2018 Let ( )EVG , be a simple and connected graph of vertex set V and edge set E. By the 2-distance chromatic number of a graph G, we mean a map ( ) { }k c GV ,1 ,2 ,3 ..., : → such that any two vertices at distance at most two from ...
KRISTIANA, Arika Indah +3 more
core
The Locating-Chromatic Number of Binary Trees [PDF]
, 2015 Let G = (V, E) be a connected graph. The locating-chromatic number of G, denoted by χL(G), is the cardinality of a minimum locating coloring of the vertex set V(G) such that all vertices have distinct coordinates. The results on locating-chromatic number
Baskoro, Edy Tri +2 more
core +1 more source
The incidence chromatic number of some graph
International Journal of Mathematics and Mathematical Sciences, 2005 The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey (1993). They conjectured that every graph G can be incidence colored with Δ(G)+2 colors.
Liu Xikui, Li Yan
doaj +1 more source
Dicromatic number and fractional chromatic number [PDF]
, 2014 Given an undirected graph G, the chromatic number χ(G) is the minimum number of partitions of V(G) into independent sets. Given a directed graph D, a vertex set is acyclic if it does not contain a directed cycle.
Wu, Hehui
core +1 more source
Matlab algorithms for traffic light assignment using fuzzy graph, fuzzy chromatic number, and fuzzy inference system. [PDF]
MethodsX, 2020 Rosyida I, Nurhaida, Narendra A, Widodo.
europepmc +1 more source