Complementary l1-graphs

S. Shpectorov

doi:10.1016/S0012-365X(98)0007X-1

Complementary l₁-graphs

S. Shpectorov^*

^*Corresponding author for this work

Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We classify pairs of complementary graphs on v≥22 vertices, that are both l₁-graphs.

Original language	English
Pages (from-to)	323-331
Number of pages	9
Journal	Discrete Mathematics
Volume	192
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(98)0007X-1
Publication status	Published - 28 Oct 1998

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0012-365X(98)0007X-1

Cite this

@article{13d88507fdb44d719456a44faaee8258,

title = "Complementary l1-graphs",

abstract = "We classify pairs of complementary graphs on v≥22 vertices, that are both l1-graphs.",

author = "S. Shpectorov",

year = "1998",

month = oct,

day = "28",

doi = "10.1016/S0012-365X(98)0007X-1",

language = "English",

volume = "192",

pages = "323--331",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Complementary l1-graphs

AU - Shpectorov, S.

PY - 1998/10/28

Y1 - 1998/10/28

N2 - We classify pairs of complementary graphs on v≥22 vertices, that are both l1-graphs.

AB - We classify pairs of complementary graphs on v≥22 vertices, that are both l1-graphs.

UR - https://www.scopus.com/pages/publications/0042638241

U2 - 10.1016/S0012-365X(98)0007X-1

DO - 10.1016/S0012-365X(98)0007X-1

M3 - Article

AN - SCOPUS:0042638241

SN - 0012-365X

VL - 192

SP - 323

EP - 331

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3