1 citations · 2 across the 4 of their papers we have counts for
4 papers
Weakly Negative Circles Versus Best Clustering in Signed Graphs
Michael G. Gottstein, Leila Parsaei-Majd, Thomas Zaslavsky
Clustering a signed graph means partitioning the vertices into sets ("clusters") so that every positive edge, and no negative edge, is within a cluster. Clustering is not always po…
Cobiased graphs: Single-element extensions and elementary quotients of graphic matroids
Daniel Slilaty, Thomas Zaslavsky
Zaslavsky (1991) introduced a graphical structure called a biased graph and used it to characterize all single-element coextensions and elementary lifts of graphic matroids. We int…
The Rhodes semilattice of a biased graph
Michael J. Gottstein, Thomas Zaslavsky
We reinterpret the Rhodes semilattices of a group in terms of gain graphs and generalize them to all gain graphs, both as sets of partition-poten…
Lattice Points in Orthotopes and a Huge Polynomial Tutte Invariant of Weighted Gain Graphs
David Forge, Thomas Zaslavsky
A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group…