On s-distance-transitive graphs

Hui Zhou; Cheryl Praeger; Michael Giudici; Rongquan Feng; Xingui Fang

On s-distance-transitive graphs

Hui Zhou, Cheryl Praeger, Michael Giudici, Rongquan Feng, Xingui Fang

Mathematics and Statistics

Research output: Working paper › Preprint

2 Downloads (Pure)

Abstract

Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitivity implies distance-regularity. In this paper, we give similar results, i.e. for special s and graphs with other restrictions we show that s-distance-transitivity implies distance-regularity.

Original language	English
Publisher	arXiv
Number of pages	34
Publication status	Unpublished - 21 Oct 2018

Access to Document

1810.08986v1Submitted manuscript, 904 KB

Cite this

@techreport{ccc02a99c63b40b7934267d699fd06ae,

title = "On s-distance-transitive graphs",

abstract = "Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitivity implies distance-regularity. In this paper, we give similar results, i.e. for special s and graphs with other restrictions we show that s-distance-transitivity implies distance-regularity. ",

keywords = "Automorphism group, distance transitive graphs, Arc-transitive graphs",

author = "Hui Zhou and Cheryl Praeger and Michael Giudici and Rongquan Feng and Xingui Fang",

year = "2018",

month = oct,

day = "21",

language = "English",

publisher = "arXiv",

address = "United States",

type = "WorkingPaper",

institution = "arXiv",

}

TY - UNPB

T1 - On s-distance-transitive graphs

AU - Zhou, Hui

AU - Praeger, Cheryl

AU - Giudici, Michael

AU - Feng, Rongquan

AU - Fang, Xingui

PY - 2018/10/21

Y1 - 2018/10/21

N2 - Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitivity implies distance-regularity. In this paper, we give similar results, i.e. for special s and graphs with other restrictions we show that s-distance-transitivity implies distance-regularity.

AB - Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitivity implies distance-regularity. In this paper, we give similar results, i.e. for special s and graphs with other restrictions we show that s-distance-transitivity implies distance-regularity.

KW - Automorphism group

KW - distance transitive graphs

KW - Arc-transitive graphs

M3 - Preprint

BT - On s-distance-transitive graphs

PB - arXiv

ER -

On s-distance-transitive graphs

Abstract

Access to Document

Fingerprint

Cite this