Numerical Measures for Two-Graphs

Simple item page
dc.creatorDuncan, David M.
dc.creatorHoffman, Thomas R.
dc.creatorSolazzo, James P.
dc.date2008-10-17
dc.date.accessioned2026-07-07T10:11:16Z
dc.date.available2026-07-07T10:11:16Z
dc.descriptionWe 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.
dc.description15 pages, accepted by the Rocky Mountain Journal of Mathematics
dc.identifierhttps://arxiv.org/abs/0810.3189
dc.identifierhttp://arxiv.org/abs/0810.3189
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171809
dc.subjectCombinatorics
dc.subjectFunctional Analysis
dc.subject05C50;42C15
dc.titleNumerical Measures for Two-Graphs
dc.typetext

Files

Collections

arXiv