Voir la notice de l'article provenant de la source Numdam
Let and be two graphs. The Kronecker product has vertex set and edge set . In this paper we determine the super edge–connectivity of . More precisely, for denotes the super edge–connectivity of , then at least edges need to be removed from to get a disconnected graph that contains no isolated vertices.
Boruzanli Ekinci, Gülnaz 1 ; Kirlangic, Alpay 1
@article{RO_2018__52_2_561_0, author = {Boruzanli Ekinci, G\"ulnaz and Kirlangic, Alpay}, title = {The super edge connectivity of {Kronecker} product graphs}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {561--566}, publisher = {EDP-Sciences}, volume = {52}, number = {2}, year = {2018}, doi = {10.1051/ro/2017080}, mrnumber = {3880544}, zbl = {1398.05172}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2017080/} }
TY - JOUR AU - Boruzanli Ekinci, Gülnaz AU - Kirlangic, Alpay TI - The super edge connectivity of Kronecker product graphs JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2018 SP - 561 EP - 566 VL - 52 IS - 2 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ro/2017080/ DO - 10.1051/ro/2017080 LA - en ID - RO_2018__52_2_561_0 ER -
%0 Journal Article %A Boruzanli Ekinci, Gülnaz %A Kirlangic, Alpay %T The super edge connectivity of Kronecker product graphs %J RAIRO - Operations Research - Recherche Opérationnelle %D 2018 %P 561-566 %V 52 %N 2 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ro/2017080/ %R 10.1051/ro/2017080 %G en %F RO_2018__52_2_561_0
Boruzanli Ekinci, Gülnaz; Kirlangic, Alpay. The super edge connectivity of Kronecker product graphs. RAIRO - Operations Research - Recherche Opérationnelle, Tome 52 (2018) no. 2, pp. 561-566. doi: 10.1051/ro/2017080
Cité par Sources :