On counting limited outdegree grid digraphs and greatest increase grid digraphs

DOI10.2140/INVOLVE.2016.9.211zbMATH Open1333.05133OpenAlexW2325240781MaRDI QIDQ258640FDOQ258640

Authors: Joshua Chester, Linnea Edlin, Jonah Galeota-Sprung, Bradley Isom, Alexander Moore, Virginia Perkins, A. Malcolm Campbell, Todd T. Eckdahl, Jeffrey L. Poet, Laurie J. Heyer 

Publication date: 10 March 2016

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2016.9.211

Recommendations

• Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree
• scientific article; zbMATH DE number 861357
• The asymptotic number of acyclic digraphs. II
• Digraphs with maximum number of paths and cycles
• A note on degree/diameter monotonicity of digraphs

zbMATH Keywords

enumerationdirected graphdiscrete gradient ascentgreatest increase grid graphlimited outdegree grid graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

This page was built for publication: On counting limited outdegree grid digraphs and greatest increase grid digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q258640)