Grech, Mariusz and Kisielewicz, Andrzej - All totally symmetric colored graphs

dmtcs:630 - Discrete Mathematics & Theoretical Computer Science, March 22, 2013, Vol. 15 no. 1
All totally symmetric colored graphs

Authors: Grech, Mariusz and Kisielewicz, Andrzej

In this paper we describe all edge-colored graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. They correspond to fully symmetric homogeneous factorizations of complete graphs. Our description completes the work done in our previous paper, where we have shown, in particular, that there are no such graphs with more than 5 colors. Using some recent results, with a help of computer, we settle all the cases that was left open in the previous paper.


Source : oai:HAL:hal-00990612v1
Volume: Vol. 15 no. 1
Section: Graph Theory
Published on: March 22, 2013
Submitted on: January 3, 2012
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Browsing statistics

This page has been seen 60 times.
This article's PDF has been downloaded 40 times.