Opening book details…
Can I read Colorings in Digraphs from the Spectral Radius on EtoBox?
Colorings in Digraphs from the Spectral Radius by Suil O is a Mathematics article available to read on EtoBox.
What is Colorings in Digraphs from the Spectral Radius about?
In this paper, we prove that for a digraph D, we have ρ ( D ) ≤ max v ∈ V ( D ) ∑ u ∈ N − ( v ) d + ( u ) , where for a vertex v ∈ V ( D ) , d + ( v ) is the number of vertices u such that vu is an arc. As a result, we prove χ ( D ) ≤ 1 + max v ∈ V ( D ) ∑ u ∈ N − ( v ) d + ( u ) . We also prove that ρ ( D ) ≤ m − δ + ( D ) ( 1 + n m i n ′ ( D ) ) , where m is the number of arcs in D, δ + ( D ) = min v ∈ V ( D ) d + ( v ) , and n m i n ′ ( D ) = min v ∈ V ( D ) | { u : u v is an arc but v u is not an arc } | .
Who reads Colorings in Digraphs from the Spectral Radius?
It is typically read by researchers, students, and practitioners in Mathematics.
- Author
- Suil O
- Publisher
- Elsevier BV
- Published
- 2022
- Language
- EN
- Field
- Mathematics (Physical Sciences)