Open AccessOn cyclically embeddable (n,n)-graphs
Author(s) -
Agnieszka Görlich,
Monika Pilśniak,
Mariusz Woźniak
Publication year - 2003
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1187
Subject(s) - mathematics , combinatorics
An embedding of a simple graph G into its complement G is a permutation σ on V (G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider the embeddable (n, n)-graphs. We prove that with few exceptions the corresponding permutation may be chosen as cyclic one.
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