On switching classes of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3756498 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- scientific article; zbMATH DE number 3194323 (Why is no real title available?)
- A congruence theorem for trees
- Congruence criteria for finite subsets of complex projective and complex hyperbolic spaces
- Enumeration of weak isomorphism classes of signed graphs
- Equiangular lines in Euclidean spaces
- Graph reconstruction -- some new developments
- Hadamard's determinant theorem and the sum of four squares
- On the Number of Self-Complementary Graphs and Digraphs
- Orthogonal Matrices with Zero Diagonal
- Reconstruction from vertex-switching
- Self-complementary graphs
- The shape invariant of triangles and trigonometry in two-point homogeneous spaces
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
Cited in
(13)- Switching classes of directed graphs and H-equivalent matrices
- Switchings, extensions, and reductions in central digraphs
- Two-graphs and NSSDs: an algebraic approach
- Open problems in the spectral theory of signed graphs
- Graph classes and the switch Markov chain for matchings
- Some switching invariant prime graphs
- Switching in one-factorisations of complete graphs
- Speeding up Graph Algorithms via Switching Classes
- On cospectrality of gain graphs
- On Switching to H-Free Graphs
- scientific article; zbMATH DE number 4057569 (Why is no real title available?)
- On Switching to H‐Free Graphs
- On a connection between the switching separability of a graph and that of its subgraphs
This page was built for publication: On switching classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747120)