On switching classes of graphs
DOI10.1016/j.laa.2018.03.037zbMath1390.05148OpenAlexW2790568957MaRDI QIDQ1747120
Augustin Fruchard, Boumediene Et-Taoui
Publication date: 3 May 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.03.037
Seidel switchingsignatureself-complementarySeidel adjacency matrixshape invariantPaley conference graph
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) General theory of linear incidence geometry and projective geometries (51A05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A congruence theorem for trees
- Equiangular lines in Euclidean spaces
- The shape invariant of triangles and trigonometry in two-point homogeneous spaces
- Reconstruction from vertex-switching
- Congruence criteria for finite subsets of complex projective and complex hyperbolic spaces
- Graph reconstruction -- some new developments
- Hadamard's determinant theorem and the sum of four squares
- Enumeration of weak isomorphism classes of signed graphs
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
- Orthogonal Matrices with Zero Diagonal
- On the Number of Self-Complementary Graphs and Digraphs
- Self-complementary graphs
This page was built for publication: On switching classes of graphs