119 citations · 207 across the 49 of their papers we have counts for
7 papers · 1 filter
Six signed Petersen graphs, and their automorphisms
Thomas Zaslavsky
Up to switching isomorphism there are six ways to put signs on the edges of the Petersen graph. We prove this by computing switching invariants, especially frustration indices and…
Directionally 2-Signed and Bidirected Graphs
E. Sampathkumar, M. A. Sriraj, Thomas Zaslavsky
An edge uv in a graph Γ is directionally 2-signed (or, (2,d)-signed) by an ordered pair (a,b), a,b in {+,-}, if the label l(uv) = (a,b) from u to v, and l(vu) = (b,a) from v to u.…
Matrices in the Theory of Signed Simple Graphs
Thomas Zaslavsky
I discuss the work of many authors on various matrices used to study signed graphs, concentrating on adjacency and incidence matrices and the closely related topics of Kirchhoff (`…
On Adjacency Matrices and Descriptors of Signed Cycle Graphs
A. M. Mathai, Thomas Zaslavsky
This paper deals with adjacency matrices of signed cycle graphs and chemical descriptors based on them. The eigenvalues and eigenvectors of the matrices are calculated and their ef…
Signed Graphs and Geometry
Thomas Zaslavsky
These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of si…
A -Queens Problem. I. General Theory
Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky
By means of the Ehrhart theory of inside-out polytopes we establish a general counting theory for nonattacking placements of chess pieces with unbounded straight-line moves, such a…
Which Exterior Powers are Balanced?
Devlin Mallory, Abigail Raz, Christino Tamon +1
A signed graph is a graph whose edges are given (-1,+1) weights. In such a graph, the sign of a cycle is the product of the signs of its edges. A signed graph is called balanced if…