Premium
N‐extendability of symmetric graphs
Author(s) -
Aldred R. E. L.,
Holton D. A.,
Lou Dingjun
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170213
Subject(s) - combinatorics , mathematics , graph , transitive relation , enhanced data rates for gsm evolution , order (exchange) , upper and lower bounds , discrete mathematics , computer science , telecommunications , mathematical analysis , finance , economics
It is proved that a cyclically ( k − 1)(2 n − 1)‐edge‐connected edge transitive k ‐regular graph with even order is n ‐extendable, where k ≥ 3 and k − 1 ≥ n ≥ ⌈( k + 1)/2⌉. The bound of cyclic edge connectivity is sharp when k = 3. © 1993 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom