Numerical Measures for Two-Graphs
Combinatorics
2008-10-20 v1 Functional Analysis
Abstract
We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on vertices. Two conjectures are stated, one using these numerical measures and the other using the deck of a graph, which suggest that there is a finite set of conditions differentiating two-graphs. We verify that, among the four non-trivial non-isomorphic regular two-graphs on 26 vertices, both conjectures hold.
Keywords
Cite
@article{arxiv.0810.3189,
title = {Numerical Measures for Two-Graphs},
author = {David M. Duncan and Thomas R. Hoffman and James P. Solazzo},
journal= {arXiv preprint arXiv:0810.3189},
year = {2008}
}
Comments
15 pages, accepted by the Rocky Mountain Journal of Mathematics