Results 31 to 40 of about 8,657,296 (197)
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
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
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
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
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
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
Analysis of Chromatic Aberration Effects in Triple-Junction Solar Cells Using Advanced Distributed Models [PDF]
, 2011 The consideration of real operating conditions for the design and optimization of a multijunction solar cell receiver-concentrator assembly is indispensable.
Espinet González, Pilar +8 more
core +1 more source
Trees with Certain Locating-chromatic Number
Journal of Mathematical and Fundamental Sciences, 2016 The locating-chromatic number of a graph G can be defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are ...
Dian Kastika Syofyan +2 more
doaj +1 more source
Star multigraphs with three vertices of maximum degree. [PDF]
, 1986 The graphs we consider here are either simple graphs, that is they have no loops or multiple edges, or are multigraphs, that is they may have more than one edge joining a pair of vertices, but again have no loops.
Hilton, A. J. W., Chetwynd, Amanda G.
core +3 more sources
List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok
Selecciones Matemáticas, 2019 In this paper, we determine list-chromatic number and characterize chromatically unique of the graph G = Kr2+k.
Le Xuan Hung
doaj +1 more source