On size, order, diameter and edge-connectivity of graphs

DOI10.1007/s10474-017-0699-1zbMath1399.05117OpenAlexW2603475120MaRDI QIDQ682097

Tomáš Vetrík, Simon Mukwembi, Jaya Percival Mazorodze, Patrick Ali

Publication date: 13 February 2018

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

Full work available at URL: https://doi.org/10.1007/s10474-017-0699-1

zbMATH Keywords

diametersizeorderedge-connectivityextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Related Items (4)

Gutman index, edge-Wiener index and edge-connectivity ⋮ Distances in graphs of girth 6 and generalised cages ⋮ Diameter, edge-connectivity, and \(C_4\)-freeness ⋮ Size of graphs and digraphs with given diameter and connectivity constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On size, order, diameter and minimum degree
• On the least size of a graph with a given degree set
• Minimum size of a graph or digraph of given radius
• Graphs of maximum diameter
• Radius, diameter, and minimum degree
• Maximum sizes of graphs with given domination parameters
• The maximum number of edges in a minimal graph of diameter 2
• Diameters in graphs

This page was built for publication: On size, order, diameter and edge-connectivity of graphs