- Gert
Sabidussi (28
October 1929 – 1
April 2022) was an
Austrian mathematician specializing in
combinatorics and
graph theory.
Sabidussi was born in Graz...
-
notably by Gert
Sabidussi (1960). Hahn &
Sabidussi (1997).
Sabidussi (1960);
Vizing (1963).
Imrich & Klavžar (2000), Theorem 4.19.
Sabidussi (1957). Horvat...
- symmetries,
providing a
realization of this type for the
trivial group. Gert
Sabidussi showed that any
group can be
realized as the
symmetry groups of countably...
-
generalized to
infinite graphs in
which every vertex has
finite degree (
Sabidussi 1964). If a
countably infinite graph G has no odd-degree vertices, then...
- the Wi****ersrand,
University of Cambridge,
University of
Waterloo Thesis Matroids on
Complete Boolean Algebras (1970)
Doctoral advisor Gert
Sabidussi...
- "Partial
algebras – an
introductory survey". In Ivo G. Rosenberg; Gert
Sabidussi (eds.).
Algebras and Orders.
Springer Science &
Business Media. ISBN 978-0-7923-2143-9...
- are vertex-transitive. The
following is a kind of
converse to this:
Sabidussi's Theorem—An (unlabeled and uncolored)
directed graph Γ {\displaystyle...
-
discontinuities and the
effect of disturbances", in Clarke, F. H.; Stern, R. J.;
Sabidussi, G. (eds.),
Nonlinear Analysis,
Differential Equations and Control, Springer...
- (y)} in H.
Graph product Strong product of
graphs Weichsel 1962. Hahn &
Sabidussi 1997.
Imrich & Klavžar 2000,
Theorem 5.29
Brown et al. 2008; see also...
- the
joint supervision of Gert
Sabidussi and Alex Rosa, and his PhD at the
Universite de Montreal, with Gert
Sabidussi. In his PhD
research he pioneered...
