On self-complementation

A. Benhocine; A.P. Wojda

doi:10.1002/jgt.3190090305

On self-complementation

A. Benhocine, A.P. Wojda

Research output: Contribution to journal › Article › Academic

18 Citations (Scopus)

266 Downloads (Pure)

Abstract

We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n - 1, is contained in a self-complementary graph of order n. We study a similar problem for digraphs.

Original language	Undefined
Pages (from-to)	335-341
Journal	Journal of graph theory
Volume	9
Issue number	3
DOIs	https://doi.org/10.1002/jgt.3190090305
Publication status	Published - 1985

Keywords

IR-70709

Access to Document

10.1002/jgt.3190090305

Benhocine85on

Cite this

@article{f3108ce86b874dd38c34d2ec2b86eeb9,

title = "On self-complementation",

abstract = "We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n - 1, is contained in a self-complementary graph of order n. We study a similar problem for digraphs.",

keywords = "IR-70709",

author = "A. Benhocine and A.P. Wojda",

year = "1985",

doi = "10.1002/jgt.3190090305",

language = "Undefined",

volume = "9",

pages = "335--341",

journal = "Journal of graph theory",

issn = "0364-9024",

publisher = "Wiley",

number = "3",

}

TY - JOUR

T1 - On self-complementation

AU - Benhocine, A.

AU - Wojda, A.P.

PY - 1985

Y1 - 1985

N2 - We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n - 1, is contained in a self-complementary graph of order n. We study a similar problem for digraphs.

AB - We prove that, with very few exceptions, every graph of order n, n - 0, 1(mod 4) and size at most n - 1, is contained in a self-complementary graph of order n. We study a similar problem for digraphs.

KW - IR-70709

U2 - 10.1002/jgt.3190090305

DO - 10.1002/jgt.3190090305

M3 - Article

SN - 0364-9024

VL - 9

SP - 335

EP - 341

JO - Journal of graph theory

JF - Journal of graph theory

IS - 3

ER -