Two-graphs and NSSDs: an algebraic approach

DOI10.1016/j.dam.2018.05.003zbMath1464.05250OpenAlexW2805591908MaRDI QIDQ2026326

Irene Sciriha, Luke Collins

Publication date: 19 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.003

zbMATH Keywords

eigenvaluesinvolutionsswitchingtwo-graphsNSSDsnutful graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

On singular signed graphs with nullspace spanned by a full vector: signed nut graphs ⋮ Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum

Cites Work

• Graphs with a common eigenvalue deck
• Rank-preserving diagonal completions of a matrix
• The regular two-graph on 276 vertices
• Regular two-graphs on 36 vertices
• On the inverse of the adjacency matrix of a graph
• Complete graphs with zero diagonal inverse
• Coalesced and embedded nut graphs in singular graphs
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
• Non-singular graphs with a singular deck
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two-graphs and NSSDs: an algebraic approach