Congruence classes of orientable 2-cell embeddings of bouquets of circles and dipoles.
Conjugacy of Coxeter elements.
Connected resolvability of graphs
For an ordered set of vertices and a vertex in a connected graph , the representation of with respect to is the -vector = (, , where represents the distance between the vertices and . The set is a resolving set for if distinct vertices of have distinct representations with respect to . A resolving set for containing a minimum number of vertices is a basis for . The dimension is the number of vertices in a basis for . A resolving set of is connected if the subgraph...
Connection on differential modules
Connectivity and planarity of Cayley graphs.
Consistent cycles in 1/2-arc-transitive graphs.
Constructing regular maps and graphs from planar quotients
Construction of finite -groups with prescribed group of noncentral automorphisms
Constructions for cubic graphs with large girth.
Correction: “The smallest graph whose group is cyclic”
Coxeter polynomials of Salem trees
We compute the Coxeter polynomial of a family of Salem trees, and also the limit of the spectral radii of their Coxeter transformations as the number of their vertices tends to infinity. We also prove that if z is a root of multiplicities for the Coxeter polynomials of the trees respectively, then z is a root for the Coxeter polynomial of their join, of multiplicity at least where .
Cubic Cayley graphs with small diameter.
Cubic edge-transitive graphs of order .
Cycles and bipartite graph on conjugacy class of groups
Deformation and rigidity of simplicial group actions on trees.
Destroying symmetry by orienting edges: complete graphs and complete bigraphs
Our purpose is to introduce the concept of determining the smallest number of edges of a graph which can be oriented so that the resulting mixed graph has the trivial automorphism group. We find that this number for complete graphs is related to the number of identity oriented trees. For complete bipartite graphs , s ≤ t, this number does not always exist. We determine for s ≤ 4 the values of t for which this number does exist.
Determination of all rigid groups of order not exceeding 60
Die Struktur der automorphismen spezieller, endlicher, ebener, dreifach-knotenzusammenhängender graphen
Die Zusammenhangsstruktur symmetrischer Graphen.
Direct products of cyclic semigroups admitting a planar Cayley graph.