N-EXTENDABILITY OF SYMMETRICAL GRAPHS

Authors
ALDRED REL HOLTON DA LOU DJ
Citation
Rel. Aldred et al., N-EXTENDABILITY OF SYMMETRICAL GRAPHS, Journal of graph theory, 17(2), 1993, pp. 253-261
Citations number
11
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
17
Issue
2
Year of publication
1993
Pages
253 - 261
Database
ISI
SICI code
0364-9024(1993)17:2<253:NOSG>2.0.ZU;2-B
Abstract
It is proved that a cyclically (k - 1)(2n - 1)-edge-connected edge tra nsitive k-regular graph with even order is n-extendable, where k great er-than-or-equal-to 3 and k - 1 greater-than-or-equal-to n greater-tha n-or-equal-to inverted right perpendicular (k + 1)/2 inverted left per pendicular. The bound of cyclic edge connectivity is sharp when k = 3.