A graph F is said to be locally primitive if, for each vertex a, the stabilizer in Aut F of a induces a primitive permutation group on the set of vertices adjacent to a. In 1978, Richard Weiss conjectured that for a finite vertex-transitive locally primitive graph F, the number of automorphisms fixing a given vertex is bounded above by some function of the valency of F. In this paper we prove t...

Nash-Williams’ arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of ` vertices induces more than k(`− 1) edges. We prove a natural topological extension of this for locally finite infinite graphs, in which the partitioning forests are acyclic in the stronger sense that their Freudenthal compactification—the space obtained by adding their end...

A distinguishing colouring of a graph is a colouring of the vertex set such that no non-trivial automorphism preserves the colouring. Tucker conjectured that if every non-trivial automorphism of a locally finite graph moves infinitely many vertices, then there is a distinguishing 2-colouring. We show that the requirement of local finiteness is necessary by giving a nonlocally finite graph for w...

abstract. in this paper we study some relations between the power andquotient power graph of a finite group. these interesting relations motivateus to find some graph theoretical properties of the quotient power graphand the proper quotient power graph of a finite group g. in addition, weclassify those groups whose quotient (proper quotient) power graphs areisomorphic to trees or paths.

We prove a decomposition result for locally finite graphs which can be used to extend results on edge-connectivity from finite to infinite graphs. It implies that every 4k-edge-connected graph G contains an immersion of some finite 2k-edge-connected Eulerian graph containing any prescribed vertex set (while planar graphs show that G need not contain a subdivision of a simple finite graph of lar...

let $g$ be a group. the order graph of $g$ is the (undirected)graph $gamma(g)$,those whose vertices are non-trivial subgroups of $g$ and two distinctvertices $h$ and $k$ are adjacent if and only if either$o(h)|o(k)$ or $o(k)|o(h)$. in this paper, we investigate theinterplay between the group-theoretic properties of $g$ and thegraph-theoretic properties of $gamma(g)$. for a finite group$g$, we s...

a result of dixon‎, ‎evans and smith shows that if $g$ is a locally (soluble-by-finite) group whose proper subgroups are (finite rank)-by-abelian‎, ‎then $g$ itself has this property‎, ‎i.e‎. ‎the commutator subgroup of $g$ has finite rank‎. ‎it is proved here that if $g$ is a locally (soluble-by-finite) group whose proper subgroups have minimax commutator subgroup‎, ‎then also the commutator s...

We extend Tutte’s result that in a finite 3-connected graph the cycle space is generated by the peripheral circuits to locally finite graphs. Such a generalization becomes possible by the admission of infinite circuits in the graph compactified by its ends.

In a finite graph, an edge set Z is an element of the cycle space if and only if every vertex has even degree in Z. We extend this basic result to the topological cycle space, which allows infinite circuits, of locally finite graphs. In order to do so, it becomes necessary to attribute a parity to the ends of the graph.

We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in the graph compactified by its ends. It turns out that the spanning trees allowing such a generalization are precisely the end-faithful spanning trees.