Results 21 to 30 of about 22,016 (260)
DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER
Forum of Mathematics, Sigma, 2016 The dichromatic number of a graph $G$ is the maximum integer $k$
BOJAN MOHAR, HEHUI WU
doaj +1 more source
Snarks with total chromatic number 5 [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Gunnar Brinkmann +2 more
doaj +1 more source
On the local distinguishing chromatic number
AKCE International Journal of Graphs and Combinatorics, 2019 The distinguishing number of graphs is generalized in two directions by Cheng and Cowen (local distinguishing number) and Collins and Trenk (Distinguishing chromatic number). In this paper, we define and study the local distinguishing chromatic number of
Omid Khormali
doaj +2 more sources
On the Locating Chromatic Number of Barbell Shadow Path Graph
Indonesian Journal of Combinatorics, 2021 The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph.
A. Asmiati +2 more
doaj +1 more source
Fuzzy coloring and total fuzzy coloring of various types of intuitionistic fuzzy graphs [PDF]
Notes on IFS, 2023 In this paper, fuzzy coloring and total fuzzy coloring of intuitionistic fuzzy graphs are introduced. The fuzzy chromatic number, fuzzy chromatic index, total fuzzy chromatic number and total fuzzy chromatic index of both vertices and edges in ...
R. Buvaneswari, P. Revathy
doaj +1 more source
Total dominator chromatic number of a graph [PDF]
Transactions on Combinatorics, 2015 Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes.
Adel P. Kazemi
doaj
Unified Spectral Bounds on the Chromatic Number
Discussiones Mathematicae Graph Theory, 2015 One of the best known results in spectral graph theory is the following lower bound on the chromatic number due to Alan Hoffman, where μ1 and μn are respectively the maximum and minimum eigenvalues of the adjacency matrix: χ ≥ 1+μ1/−μn.
Elphick Clive, Wocjan Pawel
doaj +1 more source
Total dominator chromatic number of Kneser graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Decomposition into special substructures inheriting significant properties is an important method for the investigation of some mathematical structures. A total dominator coloring (briefly, a TDC) of a graph G is a proper coloring (i.e.
Parvin Jalilolghadr, Ali Behtoei
doaj +1 more source
ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS [PDF]
Journal of Algebraic Systems, 2020 A {it local antimagic labeling} of a connected graph $G$ with at least three vertices, is a bijection $f:E(G) rightarrow {1,2,ldots , |E(G)|}$ such that for any two adjacent vertices $u$ and $v$ of $G$, the condition $omega _{f}(u) neq omega _{f}(v ...
S. Shaebani
doaj +1 more source
Weighted graphs: Eigenvalues and chromatic number
Electronic Journal of Graph Theory and Applications, 2016 We revisit Hoffman relation involving chromatic number $\chi$ and eigenvalues. We construct some graphs and weighted graphs such that the largest and smallest eigenvalues $\lambda$ dan $\mu$ satisfy $\lambda=(1-\chi)\mu.$ We study in particular the ...
Charles Delorme
doaj +1 more source