Home
|
About Journal
|
Guide
|
Editorial Board
|
Download
|
Contact
|
Chinese
A Note on the Toughness of Generalized Petersen Graphs
Received:March 04, 1992
Key Words
:
Fund Project
:
Author Name
Affiliation
Chong-Yun Chao
Dept. of Math
& Stat.
Univ. of Pittsburgh
Pittsburgh
PA 15260 USA
Han Shaocen
Dept. of Math
& Stat.
Univ. of Pittsburgh
Pittsburgh
PA 15260 USA
Hits
:
2207
Download times
:
985
Abstract
:
We show that, for each integer n ≥ 5, the toughness of a generalized Petersen graph with 2n vertices is less than or equal to 4/3, and 4/3 is the best upper bound.
Citation:
DOI
:
10.3770/j.issn:1000-341X.1992.02.007
View Full Text
View/Add Comment
Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.
