| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648694 | Discrete Mathematics | 2011 | 15 Pages |
Abstract
This work studies the super edge connectivity and super restricted edge connectivity of direct product graphs, Cartesian product graphs, strong product graphs and lexicographic product graphs. As a result, sufficient conditions for optimizing the edge connectivity and restricted edge connectivity of these graphs are presented.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jianping Ou,