𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Eigenvalues and colorings of digraphs

✍ Scribed by Bojan Mohar

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
98 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Acyclic systems of representatives and a
Acyclic systems of representatives and acyclic colorings of digraphs
✍ Ron Aharoni; Eli Berger; Ori Kfir πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 161 KB

## Abstract A natural digraph analog of the graph theoretic concept of β€œan independent set” is that of β€œan acyclic set of vertices,” namely a set not spanning a directed cycle. By this token, an analog of the notion of coloring of a graph is that of decomposition of a digraph into acyclic sets. We

Exact colorations of graphs and digraphs
Exact colorations of graphs and digraphs
✍ Martin G. Everett; Stephen P. Borgatti πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 648 KB
Exponents of 2-coloring of symmetric dig
Exponents of 2-coloring of symmetric digraphs
✍ Yanling Shao; Yubin Gao πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 151 KB

A 2-coloring (G 1 , G 2 ) of a digraph is 2-primitive if there exist nonnegative integers h and k with h + k > 0 such that for each ordered pair (u, v) of vertices there exists an is the minimum value of h + k taken over all such h and k. In this paper, we consider 2-colorings of strongly connected