#### Filter Results:

- Full text PDF available (75)

#### Publication Year

1976

2017

- This year (1)
- Last 5 years (15)
- Last 10 years (41)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Thomas Zaslavsky
- Discrete Applied Mathematics
- 1982

of (1981a). (sg: LG, A(LG), Aut(LG)) 1981a Generalized line graphs. J. Graph Theory 5 (1981), 385–399. MR 82k:05091. Zbl. 475.05061. (sg: LG, A(LG), Aut(LG)) Dragoš M. Cvetković and Slobodan K. Simić 1978a Graphs which are switching equivalent to their line graphs. Publ. Inst. Math. (Beograd) (N.S.) 23 (37) (1978), 39–51. MR 80c:05108. Zbl. 423.05035. (sw:… (More)

- Thomas Zaslavsky
- Discrete Mathematics
- 1982

A strong Tutte function of matroids is a function of finite matroids which satisfies F ( M 1$M2) = F ( M 1 ) F ( M 2 ) and F ( M ) = aeF(M\e) + b e F ( M / e ) for e not a loop or coloop of M ,where ae , be are scalar parameters depending only on e . We classify strong Tutte functions of all matroids into seven types, generalizing Brylawski's classification… (More)

- Thomas Zaslavsky
- Journal of Graph Theory
- 1981

- Thomas Zaslavsky
- Discrete Mathematics
- 1982

- Matthias Beck, Thomas Zaslavsky
- J. Comb. Theory, Ser. B
- 2006

The existence of an integral flow polynomial that counts nowhere-zero k-flows on a graph, due to Kochol, is a consequence of a general theory of inside-out polytopes. The same holds for flows on signed graphs. We develop these theories, as well as the related counting theory of nowhere-zero flows on a signed graph with values in an abelian group of odd… (More)

- Thomas Zaslavsky
- Discrete Mathematics
- 1984

- Thomas Zaslavsky
- 2008

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 (‘Laplacian’) matrices, line graphs, and very strong regularity.

We investigate the least common multiple of all subdeterminants, lcmd(A⊗B), of a Kronecker product of matrices, of which one is an integral matrix A with two columns and the other is the incidence matrix of a complete graph with n vertices. We prove that this quantity is the least common multiple of lcmd(A) to the power n− 1 and certain binomial functions… (More)