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
โฆ 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
Spectral radius of graphs with given mat
โ
Lihua Feng; Guihai Yu; Xiao-Dong Zhang
๐
Article
๐
2007
๐
Elsevier Science
๐
English
โ 117 KB
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