Results 41 to 50 of about 9,006,025 (294)
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 the fractional chromatic number, the chromatic number, and graph products
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandi Klavzar, Hong-Gwa Yeh
openaire +3 more sources
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs
European Journal of Combinatorics, 1998 This paper studies the circular (or star) chromatic numbers and fractional chromatic numbers of distance graphs \(G(Z, D)\) for various sets \(D\) (being the graph with vertex set a subset of the integers, and two vertices \(x\), \(y\) being adjacent iff \(| x-y|\in D\)). Various specific cases are calculated, including all cases when \(| D|= 2\).
Chang, Gerard J. +2 more
openaire +3 more sources
High-speed chromatic dispersion monitoring of a two-channel WDM system using a single TPA microcavity [PDF]
, 2008 Chromatic dispersion monitoring of two 160 Gb/s wavelength channels using a TPA Microcavity is presented. As the microcavity exhibits a wavelength resonance characteristic, a single device could monitor a number of different WDM-channels ...
Guo, Wei Hua +7 more
core +2 more sources
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
A Tight Bound on the Set Chromatic Number
Discussiones Mathematicae Graph Theory, 2013 We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that χs(G) > ⌈log2 χ(G)⌉ + 1, where χs(G) and χ(G) are the set chromatic number and the chromatic number of G ...
Sereni Jean-Sébastien +1 more
doaj +1 more source
Hamiltonian chromatic number of block graphs
Journal of Graph Algorithms and Applications, 2017 Let $G$ be a simple connected graph of order $n$. A hamiltonian coloring $c$ of a graph $G$ is an assignment of colors (non-negative integers) to the vertices of $G$ such that $D(u, v)$ + $|c(u) - c(v)|$ $\geq$ $n - 1$ for every two distinct vertices $u$
Devsi Bantva
doaj +1 more source
, 2020 Let us say a graph G has "tree-chromatic number" at most k if it admits a tree-decomposition (T, (X t : t ∈ V (T ))) such that G[X t ] has chromatic number at most k for each t ∈ V (T ).
Paul Seymour
core
The b-chromatic number of power graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x i adjacent to a
Brice Effantin, Hamamache Kheddouci
doaj +2 more sources