Upper Bounds on the Diameter of Bipartite and Triangle-Free Graphs with Prescribed Edge Connectivity

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.

Saved in:
Bibliographic Details
Published in:International journal of mathematics and mathematical sciences 2020, Vol.2020 (2020), p.1-9
Main Authors: Fundikwa, Blessings T., Mukwembi, Simon, Mazorodze, Jaya P.
Format: Article
Language:English
Subjects:
Connectivity
Graphs
Inequality
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:0161-1712
1687-0425
DOI:10.1155/2020/8982474