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

Blessings T. Fundikwa,Jaya Percival Mazorodze,Simon Mukwembi

International Journal of Mathematics and Mathematical Sciences（2020）

引用 1|浏览1

暂无评分

摘要

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.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要