Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity

DOI10.1155/2020/8982474zbMath1486.05164OpenAlexW3083284736MaRDI QIDQ2223416

Blessings T. Fundikwa, Simon Mukwembi, Jaya Percival Mazorodze

Publication date: 28 January 2021

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/8982474

zbMATH Keywords

triangle-free graphsedge connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (1)

Diameter, edge-connectivity, and \(C_4\)-freeness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Radius, diameter, and minimum degree
• \(m\)-polar fuzzy graphs. Theory, methods \& applications

This page was built for publication: Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity