Premium
Every ( p , p ‐2) graph is contained in its complement
Author(s) -
Burns David,
Schuster Seymour
Publication year - 1977
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.3190010308
Subject(s) - combinatorics , mathematics , complement (music) , graph , embedding , order (exchange) , discrete mathematics , computer science , chemistry , artificial intelligence , biochemistry , complementation , gene , phenotype , finance , economics
The following is proved: If G is graph of order p (≥2) and size p ‐2, then there exists an isomorphic embedding of G into its complement.
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