An Upper Bound on the Radius of a 3-Vertex-Connected <span class="nowrap"><svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-4.1996pt" id="M1" height="15.599pt" version="1.1" viewBox="-0.0657574 -11.3994 18.0806 15.599" width="18.0806pt"><g transform="matrix(.017,0,0,-0.017,0,0)"><path id="g113-68" d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z"/></g><g transform="matrix(.012,0,0,-0.012,11.377,4.134)"><path id="g50-53" d="M462 177V227H365V632H320C217 496 116 350 21 208V177H284V109C284 43 280 38 190 31V0H451V31C369 38 365 43 365 108V177H462ZM284 227H88C155 336 218 430 282 519H284V227Z"/></g></svg>-</span>Free Graph

Journal of Mathematics

fig2

Figure 2

Figure 2: An Upper Bound on the Radius of a 3-Vertex-Connected <span class="nowrap"><svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-4.1996pt" id="M1" height="15.599pt" version="1.1" viewBox="-0.0657574 -11.3994 18.0806 15.599" width="18.0806pt"><g transform="matrix(.017,0,0,-0.017,0,0)"><path id="g113-68" d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z"/></g><g transform="matrix(.012,0,0,-0.012,11.377,4.134)"><path id="g50-53" d="M462 177V227H365V632H320C217 496 116 350 21 208V177H284V109C284 43 280 38 190 31V0H451V31C369 38 365 43 365 108V177H462ZM284 227H88C155 336 218 430 282 519H284V227Z"/></g></svg>-</span>Free Graph 

Journal of Mathematics

An Upper Bound on the Radius of a 3-Vertex-Connected -Free Graph

Figure 2