Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity (Q2223416)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity |
scientific article |
Statements
Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity (English)
0 references
28 January 2021
0 references
Summary: We present upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity with respect to order and size. All bounds presented in this paper are asymptotically sharp.
0 references
triangle-free graphs
0 references
edge connectivity
0 references
