Kayla Wager1, John T. Saccoman1
1Department of Mathematics & Computer Science, Seton Hall University, South Orange, NJ 07079, U.S.A.
Abstract:

Threshold graphs are graphs whose node set can be partitioned into a clique and an independent set, with the additional property that for each pair of nodes, one’s neighborhood is a subset of the other’s neighborhood. Threshold graphs have been well-studied in graph theory, but not much is known about multigraphs that are underlying threshold. Proper threshold graphs are those in which all nodes in the independent set have the same degree. In this paper, we present a formula for the eigenvalues of a particular class of multigraphs that are underlying proper threshold.

Daan Rijpert1, Hendrik Van Maldeghem1
1Department of Mathematics, Computer Science and Statistics, Ghent University, Belgium
Abstract:

Recently, the notion of a Weyl substructure in a spherical building was introduced type by type. In this paper we provide a uniform (axiomatic) definition across all types. In particular, this provides a new characterisation of the Ree-Tits octagons. We then show that uniclass automorphisms of spherical buildings are uniformly characterised by their fix structure. For type preserving automorphisms, this follows from earlier work, and so the focus here is on dualities. In particular, it follows that a duality pointwise fixing a Weyl substructure is automatically a polarity. This characterises all polarities in self-dual spherical buildings where opposition acts trivially on the types.