A characterization of halved cubes

Wilfried Imrich; Sandi Klavžar; Aleksander Vesel

A characterization of halved cubes

Wilfried Imrich
, Sandi Klavžar
, Aleksander Vesel

Lehrstuhl für Angewandte Mathematik (170)

Universität Maribor

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Begutachtung

1 Zitat (Scopus)

Abstract

The vertex set of a halved cube Q′d consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then it is proved that Q′d is the only connected, (d2)-regular graph on 2d-1 vertices in which every edge lies in two d-cliques and two d-cliques do not intersect in a vertex.

Originalsprache	Englisch
Seiten (von - bis)	27-32
Seitenumfang	6
Fachzeitschrift	Ars combinatoria
Jahrgang	48.1998
Ausgabenummer	2
Publikationsstatus	Veröffentlicht - Apr. 1998

Andere Dateien und Links

volume-48-paper-2

Link to publication in Scopus

Dieses zitieren

@article{549ead7b2dcd416f996aea953e22ef01,

title = "A characterization of halved cubes",

abstract = "The vertex set of a halved cube Q′d consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then it is proved that Q′d is the only connected, (d2)-regular graph on 2d-1 vertices in which every edge lies in two d-cliques and two d-cliques do not intersect in a vertex.",

author = "Wilfried Imrich and Sandi Klav{\v z}ar and Aleksander Vesel",

year = "1998",

month = apr,

language = "English",

volume = "48.1998",

pages = "27--32",

journal = "Ars combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

number = "2",

}

TY - JOUR

T1 - A characterization of halved cubes

AU - Imrich, Wilfried

AU - Klavžar, Sandi

AU - Vesel, Aleksander

PY - 1998/4

Y1 - 1998/4

N2 - The vertex set of a halved cube Q′d consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then it is proved that Q′d is the only connected, (d2)-regular graph on 2d-1 vertices in which every edge lies in two d-cliques and two d-cliques do not intersect in a vertex.

AB - The vertex set of a halved cube Q′d consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then it is proved that Q′d is the only connected, (d2)-regular graph on 2d-1 vertices in which every edge lies in two d-cliques and two d-cliques do not intersect in a vertex.

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

M3 - Article

AN - SCOPUS:0040041837

SN - 0381-7032

VL - 48.1998

SP - 27

EP - 32

JO - Ars combinatoria

JF - Ars combinatoria

IS - 2

ER -