Title of article
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs Original Research Article
Author/Authors
You Lu، نويسنده , , Jun-Ming Xu، نويسنده , , Xin-Min Hou، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
9
From page
3249
To page
3257
Abstract
The bounded edge-connectivity image of a connected graph image with respect to image is the minimum number of edges in image whose deletion from image results in a subgraph with diameter larger than image and the edge-persistence image is defined as image, where image is the diameter of image. This paper considers the Cartesian product image, shows image for image and image, and determines the exact values of image for image, image, image and image.
Keywords
Hypercubes , Paths , Diameter , Bounded edge-connectivity , Cycles , Cartesian product , Edge-persistence
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887259
Link To Document