Constructing Infinite One-regular Graphs

Norbert Seifter; Aleksander Malnic; Dragan Marusic

doi:10.1006/eujc.1999.0338

Constructing Infinite One-regular Graphs

Norbert Seifter
, Aleksander Malnic
, Dragan Marusic

Lehrstuhl für Angewandte Mathematik (170)

Universität Laibach

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Begutachtung

23 Zitate (Scopus)

Abstract

A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of infinite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.

Originalsprache	undefiniert/unbekannt
Seiten (von - bis)	845-853
Seitenumfang	9
Fachzeitschrift	European journal of combinatorics
Jahrgang	20.1998
Ausgabenummer	8
DOIs	https://doi.org/10.1006/eujc.1999.0338
Publikationsstatus	Veröffentlicht - 1999

Zugriff auf Dokument

10.1006/eujc.1999.0338

Dieses zitieren

@article{17cdecd7c2154948a3b63c4f24aaf727,

title = "Constructing Infinite One-regular Graphs",

abstract = "A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of infinite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.",

author = "Norbert Seifter and Aleksander Malnic and Dragan Marusic",

year = "1999",

doi = "10.1006/eujc.1999.0338",

language = "Undefined/Unknown",

volume = "20.1998",

pages = "845--853",

journal = "European journal of combinatorics ",

publisher = "Academic Press",

number = "8",

}

TY - JOUR

T1 - Constructing Infinite One-regular Graphs

AU - Seifter, Norbert

AU - Malnic, Aleksander

AU - Marusic, Dragan

PY - 1999

Y1 - 1999

N2 - A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of infinite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.

AB - A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of infinite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.

U2 - 10.1006/eujc.1999.0338

DO - 10.1006/eujc.1999.0338

M3 - Article

VL - 20.1998

SP - 845

EP - 853

JO - European journal of combinatorics

JF - European journal of combinatorics

IS - 8

ER -