z-logo
Premium
On regular self‐complementary graphs
Author(s) -
Hartsfield Nora
Publication year - 1987
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.3190110411
Subject(s) - mathematics , combinatorics , discrete mathematics
A regular self‐complementary graph is presented which has no complementing permutation consisting solely of cycles of length four. This answers one of Kotzig's questions.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here