Can I read Vertices of Degree K in a Minimally K-edge-connected Digraph on EtoBox?
Vertices of Degree K in a Minimally K-edge-connected Digraph by Xu-dong Yuan; Mao-cheng Cai is a Computer Science article available to read on EtoBox.
What is Vertices of Degree K in a Minimally K-edge-connected Digraph about?
Let k be a positive integer and D = (V; E) be a minimally k-edge-connected simple digraph. For a vertex x ∈ V (D), its outdegree + (x) (indegree -(x)) is the number of edges leaving (entering) In this paper we prove that which was conjectured by Mader (Combinatorics 2 (1996) 423-449). We also present a lower bound on u + (D) + u ± (D) + u -(D) when |D|¿4k -1.
Who reads Vertices of Degree K in a Minimally K-edge-connected Digraph?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Xu-dong Yuan; Mao-cheng Cai
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 2000
- Language
- EN
- Field
- Computer Science (Physical Sciences)