Premium
The multiplicity of 1‐factors in the square of a graph
Author(s) -
Hendry G. R. T.
Publication year - 1984
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.3190080308
Subject(s) - mathematics , combinatorics , graph , multiplicity (mathematics) , square (algebra) , discrete mathematics , geometry
Several authors have shown that if G is a connected graph of even order then its square G 2 has a 1‐factor. We show that the square of any connected graph of order 2 n has at least n 1‐factors and describe all the extremal graphs.
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