Matroids in terms of Cayley graphs and some related results.
Maximum exponent of Boolean circulant matrices with constant number of nonzero entries in their generating vector.
Meromorphisms of graphs
Methods of destroying the symmetries of a graph.
Moore graphs and beyond: a survey of the degree/diameter problem.
More on the girth of graphs on Weyl groups
The girth of graphs on Weyl groups, with no restriction on the associated root system, is determined. It is shown that the girth, when it is defined, is 3 except for at most four graphs for which it does not exceed 4.
Moufang trees and generalized quadrangles.
Multiples of left loops and vertex-transitive graphs
Via representation of vertex-transitive graphs on groupoids, we show that left loops with units are factors of groups, i.e., left loops are transversals of left cosets on which it is possible to define a binary operation which allows left cancellation.
Multiply quasiplatonic Riemann surfaces.