Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10331347 | Information Processing Letters | 2005 | 4 Pages |
Abstract
The (kâ1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of GâF for any FâV(G) with |F|
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Min Xu, Jun-Ming Xu, Xin-Min Hou,