scientific article; zbMATH DE number 1421650
Let \(D\) be a minimally \(k\)-edge-connected simple digraph and \(|D|\) the number of vertices in \(D\). Suppose \(u\) denotes the number of vertices in \(D\) with outdegree equal to \(k\) and indegree greater than \(k\), \(v\) the number of vertices in \(D\) with both outdegree and indegree equal to \(k\), and \(w\) the number of vertices in \(D\) with the outdegree greater than \(k\) and indegree equal to \(k\). The authors prove that if \(|D|\geq 2k-2\) then, \[ u+2v+ w\geq \begin{cases} (2|D|+ 4k^2+ 4)/3k+ 2,\quad &\text{for }k\geq 6,\\ (|D|+ 24)/7,\quad &\text{for }k= 4,\\ (2|D|+ 80)/17,\quad &\text{for }k= 5.\end{cases} \] {}.
- Vertices of degree k in a minimally k-edge-connected digraph
- Minimally k-edge-connected directed graphs of maximal size
- The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
- A remark on the number of vertices of degree k in a minimally k-edge- connected graph
- Critical vertices in k-connected digraphs
- A remark on the number of vertices of degree k in a minimally k-edge- connected graph
- Critical vertices in k-connected digraphs
- Minimally k-edge-connected directed graphs of maximal size
- On minimally 2-T-connected directed graphs
- Vertices of degree k in a minimally k-edge-connected digraph
- On Vertices of outdegree n in minimally n‐connected digraphs
- scientific article; zbMATH DE number 975388 (Why is no real title available?)
- On vertices of outdegree k in minimally k-arc-connected digraphs
- The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946545)