Numerical Measures for Two-Graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ 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.
15 pages, accepted by the Rocky Mountain Journal of Mathematics

Keywords

Combinatorics, Functional Analysis, 05C50;42C15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/171809

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0810.3189
 http://arxiv.org/abs/0810.3189

Collections

arXiv