Elsevier

Discrete Mathematics

Volume 311, Issue 6, 28 March 2011, Pages 478-492
Discrete Mathematics

On optimizing edge connectivity of product graphs☆

https://doi.org/10.1016/j.disc.2010.12.012Get rights and content
Under an Elsevier user license
open archive

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.

Keywords

Cartesian product
Direct product
Strong product
Lexicographic product
Edge connectivity

Cited by (0)

☆

This work is supported by National Natural Science Foundation of China (10801091); NSF of Guandong Province of China (9151051501000072).

Copyright © 2011 Published by Elsevier B.V.