An upper bound on the radius of a 3-edge-connected graph

Authors

  • Dankelmann, Peter
  • Mukwembi, Simon
  • Swart, Henda C.

Abstract

Let G be a 3-edge-connected graph of order n and radius rad(G). Then the inequality rad(G) ≤ 1/3n + 17/3 is proved. Moreover, graphs are constructed to show that the bound is asymptotically sharp.

Published

2007-06-09

How to Cite

Dankelmann, Peter, Mukwembi, Simon, & Swart, Henda C. (2007). An upper bound on the radius of a 3-edge-connected graph. Utilitas Mathematica, 73. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/478

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.