๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Chromatic number and spectral radius

โœ Scribed by Vladimir Nikiforov


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
106 KB
Volume
426
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Spectral radius of digraphs with given d
โœ Huiqiu Lin; Jinlong Shu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 237 KB

Let D be a digraph with vertex set V (D). A partition of V (D) into k acyclic sets is called a k-coloring of D. The minimum integer k for which there exists a k-coloring of D is the dichromatic number ฯ‡(D) of the digraph D. Denote G n,k the set of the digraphs of order n with the dichromatic number

Chromatic number and skewness
โœ Paul C Kainen ๐Ÿ“‚ Article ๐Ÿ“… 1975 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 156 KB
Signless Laplacian spectral radii of gra
โœ Guanglong Yu; Yarong Wu; Jinlong Shu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 263 KB

Let G be a simple graph with vertices v 1 , v 2 , . . . , v n , of degrees = ) is called the signless Laplacian spectral radius or Q -spectral radius of G. Denote by ฯ‡(G) the chromatic number for a graph G. In this paper, for graphs with order n, the extremal graphs with both the given chromatic num

Star chromatic number
โœ A. Vince ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 393 KB
Circular Chromatic Numbers and Fractiona
โœ G.J. Chang; L. Huang; X. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for