On the lower bound of k-maximal digraphs
From MaRDI portal
Recommendations
- On \(k\)-maximal strength digraphs
- On the \(k\)-domination number of digraphs
- The lower bound on the number of maximum matchings of a graph
- A note on lower bounds for the total domination number of digraphs
- scientific article; zbMATH DE number 1501715
- Lower bounds on the vertex-connectivity of digraphs and graphs
- Bounds on the domination number of a digraph
- Bounds on the \(k\)-domination number of a graph
- scientific article; zbMATH DE number 7403962
- A lower bound for the spectral radius of a digraph
Cites work
- scientific article; zbMATH DE number 3590311 (Why is no real title available?)
- scientific article; zbMATH DE number 3312526 (Why is no real title available?)
- k-Components, Clusters and Slicings in Graphs
- Digraphs
- Graph theory
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- On \(k\)-maximal strength digraphs
- The size of strength‐maximal graphs
Cited in
(12)- An Optimal Lower Bound for the Size of Periodic Digraphs
- On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
- On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees
- The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
- On \(k\)-maximal strength digraphs
- scientific article; zbMATH DE number 4019097 (Why is no real title available?)
- Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs
- On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
- scientific article; zbMATH DE number 6315784 (Why is no real title available?)
- On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
- On the sizes of bi-\(k\)-maximal graphs
- Arc-connectivity of regular digraphs with two orbits.
This page was built for publication: On the lower bound of \(k\)-maximal digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294549)
