Orienting and separating distance-transitive graphs

DOI10.26493/1855-3974.235.446zbMATH Open1290.05113arXiv1103.5239OpenAlexW2099891553WikidataQ129355202 ScholiaQ129355202MaRDI QIDQ5415702

Italo J. Dejter

Publication date: 14 May 2014

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Abstract: It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph with similar ultrahomogeneous properties in which those oriented cycles appear minimally "pulled apart", or "separated" and whose description is truly beautiful and insightful. This work is proposed as the initiation of a study of similar ultrahomogeneous properties for distance-transitive graphs in general with the aim of generalizing to constructions of similar related "separator" Cayley digraphs.

Full work available at URL: https://arxiv.org/abs/1103.5239

zbMATH Keywords

Cayley graph ultrahomogeneous graph distance-transitive graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other designs, configurations (05B30) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

This page was built for publication: Orienting and separating distance-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5415702)