On the lower bound of k-maximal digraphs
From MaRDI portal
Publication:294549
DOI10.1016/J.DISC.2016.04.007zbMATH Open1339.05162OpenAlexW2398587411MaRDI QIDQ294549FDOQ294549
Authors: Xiaoxia Lin, Suohai Fan, Hong-Jian Lai, Murong Xu 
Publication date: 16 June 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.04.007
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
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Connectivity (05C40)
Cites Work
Cited In (12)
- On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
- The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
- Title not available (Why is that?)
- Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs
- An Optimal Lower Bound for the Size of Periodic Digraphs
- On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
- Title not available (Why is that?)
- On \(k\)-maximal strength digraphs
- On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
- Arc-connectivity of regular digraphs with two orbits.
- On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees
- On the sizes of bi-\(k\)-maximal graphs
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)
