Numerical measures for two-graphs

DOI10.1216/RMJ-2011-41-1-133MaRDI QIDQ627376zbMATH OpenFDO

Authors David Duncan, Thomas R. Hoffman, James P. Solazzo

Publication date 1 March 2011

Published in Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

vertex switchingSeidel adjacency matrixtwo-graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90)

Abstract: 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.

Recommendations

• scientific article; zbMATH DE number 125493
• Certain graph invariants do not distinguish all graphs
• Classification of regular two-graphs on 36 and 38 vertices
• scientific article; zbMATH DE number 874570
• scientific article; zbMATH DE number 7640089

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3756498 (Why is no real title available?)
• scientific article; zbMATH DE number 107643 (Why is no real title available?)
• scientific article; zbMATH DE number 3547309 (Why is no real title available?)
• scientific article; zbMATH DE number 1952951 (Why is no real title available?)
• scientific article; zbMATH DE number 874570 (Why is no real title available?)
• scientific article; zbMATH DE number 3225111 (Why is no real title available?)
• Differential equations with MAPLE
• Frames, graphs and erasures
• Grassmannian frames with applications to coding and communication
• Isomorph-Free Exhaustive Generation
• Optimal frames for erasures.
• The art of frame theory
• Which graphs are determined by their spectrum?

Cited in

(2)

• scientific article; zbMATH DE number 6289202 (Why is no real title available?)
• Characterization of \(k\)-spectrally monomorphic two-graphs

Describes a project that uses

Uses Software

• GRAPE
• nauty
• Maple
• GAP

This page was built for publication: Numerical measures for two-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627376)