On size, order, diameter and edge-connectivity of graphs
From MaRDI portal
Publication:682097
DOI10.1007/S10474-017-0699-1zbMATH Open1399.05117OpenAlexW2603475120MaRDI QIDQ682097FDOQ682097
Authors: Simon Mukwembi, Tomáš Vetrík, Patrick Ali, J. P. Mazorodze 
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
Recommendations
- Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
- On size, order, diameter and minimum degree
- Radius, diameter and the degree sequence of a graph
- Size of graphs and digraphs with given diameter and connectivity constraints
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
Cites Work
- Radius, diameter, and minimum degree
- Maximum sizes of graphs with given domination parameters
- Title not available (Why is that?)
- On size, order, diameter and minimum degree
- Title not available (Why is that?)
- Diameters in graphs
- On the least size of a graph with a given degree set
- Minimum size of a graph or digraph of given radius
- The maximum number of edges in a minimal graph of diameter 2
- Graphs of maximum diameter
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
- Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
- Gutman index, edge-Wiener index and edge-connectivity
- Sharp Bounds on the Diameter of a Graph
- Radius, diameter and the degree sequence of a graph
- Diameter, edge-connectivity, and \(C_4\)-freeness
- Size of graphs and digraphs with given diameter and connectivity constraints
- Distances in graphs of girth 6 and generalised cages
- The size of graphs with given feedback vertex number
- Size, Order, and Connected Domination
- On size, order, diameter and minimum degree
This page was built for publication: On size, order, diameter and edge-connectivity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682097)
