On size, order, diameter and edge-connectivity of graphs
From MaRDI portal
Publication:682097
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
- scientific article; zbMATH DE number 5006840 (Why is no real title available?)
- scientific article; zbMATH DE number 4033779 (Why is no real title available?)
- scientific article; zbMATH DE number 3556138 (Why is no real title available?)
- scientific article; zbMATH DE number 3255492 (Why is no real title available?)
- Diameters in graphs
- Graphs of maximum diameter
- Maximum sizes of graphs with given domination parameters
- Minimum size of a graph or digraph of given radius
- On size, order, diameter and minimum degree
- On the least size of a graph with a given degree set
- Radius, diameter, and minimum degree
- The maximum number of edges in a minimal graph of diameter 2
Cited in
(11)- Size of graphs and digraphs with given diameter and connectivity constraints
- Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
- Sharp Bounds on the Diameter of a Graph
- Gutman index, edge-Wiener index and edge-connectivity
- Diameter, edge-connectivity, and \(C_4\)-freeness
- Size, Order, and Connected Domination
- On size, order, diameter and minimum degree
- Radius, diameter and the degree sequence of a graph
- Distances in graphs of girth 6 and generalised cages
- The size of graphs with given feedback vertex number
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)
