Orienting and separating distance-transitive graphs

From MaRDI portal

DOI10.26493/1855-3974.235.446MaRDI QIDQ5415702zbMATH OpenOpenAlexWikidataFDO

Authors Italo J. Dejter

Publication date 14 May 2014

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

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


zbMATH Keywords

Cayley graphdistance-transitive graphultrahomogeneous graph

Mathematics Subject Classification ID

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


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.


Recommendations



Cited in
(1)








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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Orienting_and_separating_distance-transitive_graphs&oldid=96164210"
Powered by MediaWiki