Order and Radius of 3-Connected Graphs: AKCE International Journal of Graphs and Combinatorics: Vol 4, No 1

Views

CrossRef citations to date

Altmetric

Abstract

We show that if G is a 3-connected graph with radius r, then |V(G)| ≥ 4r-4.

Keywords:

3-connected graph
radius

2000 Mathematics Subject Classification:

05C12

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Order and Radius of 3-Connected Graphs

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

Order and Radius of 3-Connected Graphs

Abstract

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date