An Upper Bound on the Diameter of a 3-Edge-Connected C 4 -Free Graph

Blessings T. Fundikwa,Jaya P. Mazorodze,Simon Mukwembi

Indian Journal of Pure & Applied Mathematics（2021）

引用 3|浏览0

暂无评分

摘要

We give an upper bound on the diameter of a 3-edge-connected C 4 -free graph in terms of order. In particular we show that if G is a 3-edge-connected C 4 free graph of order n , and diameter d , then the inequality d ≤3n 7 — 3 7 holds. Moreover, graphs are constructed to show that the bound is almost asymptotically sharp.

查看译文

关键词

Diameter,edge-connectivity

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要