119 citations · 207 across the 49 of their papers we have counts for
57 papers
On strongly regular signed graphs of higher girth
Quaid Iqbal, Thomas Zaslavsky
Strongly regular signed graphs are an extension of strongly regular graphs to the realm of signed graphs, that is, graphs where each edge is positive or negative. Unlike with ordin…
Projective Rectangles: A New Kind of Incidence Structure
Rigoberto Florez, Thomas Zaslavsky
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties,…
Whitney Numbers of Partial Dowling Lattices
Thomas Zaslavsky
The Dowling lattice , a finite group, generalizes the geometric lattice generated by all vectors, over a field, with at most two nonzero component…
Vector Valued Switching in Signed Graphs
Shahul Hameed K, Albin Mathew, Germina K A +1
A signed graph is a graph with edges marked positive and negative; it is unbalanced if some cycle has negative sign product. We introduce the concept of vector valued switching fun…
Matroids of Gain Signed Graphs
Laura Anderson, Ting Su, Thomas Zaslavsky
A signed graph has edge signs. A gain graph has oriented edge gains drawn from a group. We define the combination of the two for the abelian case, in which each oriented edge of a…
Two Hamiltonian cycles
Vaidy Sivaraman, Thomas Zaslavsky
If the line graph of a graph decomposes into Hamiltonian cycles, what is ? We answer this question for decomposition into two cycles.