相关论文: Connectedness of spheres in Cayley graphs

Networks are inherently vulnerable to vertex failures, making the analysis of their structural robustness a fundamental problem in graph theory. In this study, we investigate the closeness and vertex residual closeness of graphs, with a…

We give an introduction to the Cayley-Abels graph for a totally disconnected, locally compact (tdlc) group. It is a generalization of the Cayley graph. We illustrate that on the one hand, Cayley-Abels graphs are useful tools to extend…

In a class of carbon-based materials called polymerized triptycene, which consist of triptycene molecules and phenyls, exotic electronic structures such as Dirac cones and flat bands arise from the kagome-type network. In this paper, we…

The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the…

We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…

The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…

Given a finitely generated group $G$ that is relatively finitely presented with respect to a collection of peripheral subgroups, we prove that every infinite subgroup $H$ of $G$ that is bounded in the relative Cayley graph of $G$ is…

In infinite graph theory, the notion of ends, first introduced by Freudenthal and Jung for locally finite graphs, plays an important role when generalizing statements from finite graphs to infinite ones. Nash-Willian's Tree-Packing Theorem…

Strong cospectrality is an equivalence relation on the set of vertices of a graph that is of importance in the study of quantum state transfer in graphs. We construct families of abelian Cayley graphs in which the number of mutually…

The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…

In \cite{Elek} we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associate a type $II_1$-von Neumann algebra to such graph sequences.…

We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…

Let $\Gamma$ be a Cayley graph generated by a transposition tree. A natural problem is to understand how the properties of the Cayley graph depend on those of the underlying transposition tree. We focus here on diameter and distance related…

We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…

We prove that every amenable one-ended Cayley graph has an invariant spanning tree of one end. More generally, for any 1-ended amenable unimodular random graph we construct a factor of iid percolation (jointly unimodular subgraph) that is…

For any finite group $A$ and any finitely generated group $B$, we prove that the corresponding lamplighter group $A\wr B$ admits a standard generating set with unbounded depth, and that if $B$ is abelian then the above is true for every…

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

This paper is a short introduction to the theory of tangles, both in graphs and general connectivity systems. An emphasis is put on the correspondence between tangles of order k and k-connected components. In particular, we prove that there…

We characterise the quotient surface graphs arising from symmetric contact systems of line segments in the plane and also from symmetric pointed pseudotriangulations in the case where the group of symmetries is generated by a translation or…

We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…