On graphs with regular groups

Wilfried Imrich

doi:10.1016/0095-8956(75)90082-9

On graphs with regular groups

Wilfried Imrich

Lehrstuhl für Angewandte Mathematik (170)

University of Montreal

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Begutachtung

9 Zitate (Scopus)

Abstract

A new method for the construction of graphs with given regular group is developed and used to show that to every nonabelian group G of order 3k, k ≥ 4, there exists a graph X whose automorphism group is isomorphic to G and regular as a permutation group on the set of vertices of X.

Originalsprache	Englisch
Seiten (von - bis)	174-180
Seitenumfang	7
Fachzeitschrift	Journal of Combinatorial Theory, Series B
Jahrgang	19.1975
Ausgabenummer	2
DOIs	https://doi.org/10.1016/0095-8956(75)90082-9
Publikationsstatus	Veröffentlicht - Okt. 1975

Zugriff auf Dokument

10.1016/0095-8956(75)90082-9

Andere Dateien und Links

Link to publication in Scopus

Dieses zitieren

@article{9827353fcb014976a16f836d32d80c79,

title = "On graphs with regular groups",

abstract = "A new method for the construction of graphs with given regular group is developed and used to show that to every nonabelian group G of order 3k, k ≥ 4, there exists a graph X whose automorphism group is isomorphic to G and regular as a permutation group on the set of vertices of X.",

author = "Wilfried Imrich",

year = "1975",

month = oct,

doi = "10.1016/0095-8956(75)90082-9",

language = "English",

volume = "19.1975",

pages = "174--180",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - On graphs with regular groups

AU - Imrich, Wilfried

PY - 1975/10

Y1 - 1975/10

N2 - A new method for the construction of graphs with given regular group is developed and used to show that to every nonabelian group G of order 3k, k ≥ 4, there exists a graph X whose automorphism group is isomorphic to G and regular as a permutation group on the set of vertices of X.

AB - A new method for the construction of graphs with given regular group is developed and used to show that to every nonabelian group G of order 3k, k ≥ 4, there exists a graph X whose automorphism group is isomorphic to G and regular as a permutation group on the set of vertices of X.

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

U2 - 10.1016/0095-8956(75)90082-9

DO - 10.1016/0095-8956(75)90082-9

M3 - Article

AN - SCOPUS:49549148321

SN - 0095-8956

VL - 19.1975

SP - 174

EP - 180

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 2

ER -