Size of graphs and digraphs with given diameter and connectivity constraints

DOI10.1007/s10474-021-01137-7zbMath1488.05153OpenAlexW3158780250MaRDI QIDQ2043684

Peter Dankelmann

Publication date: 3 August 2021

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10474-021-01137-7

zbMATH Keywords

digraphdiameterconnectivityedge-connectivityEulerian digraph

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• On size, order, diameter and minimum degree
• Distance and size in digraphs
• Minimum orders of Eulerian oriented digraphs with given diameter
• The diameter of almost Eulerian digraphs
• A note on diameter and the degree sequence of a graph
• On size, order, diameter and edge-connectivity of graphs
• Diameter and maximum degree in Eulerian digraphs
• Graphs of maximum diameter
• Radius, diameter, and minimum degree
• On the sum of all distances in a graph or digraph
• Maximum diameter of regular digraphs
• Diameters in graphs

This page was built for publication: Size of graphs and digraphs with given diameter and connectivity constraints