نتایج جستجو برای: locally finite graph
تعداد نتایج: 514983 فیلتر نتایج به سال:
We study the physical Laplacian and the corresponding heat flow on an infinite, locally finite graph with possibly unbounded valence.
it is proved here that if $g$ is a locally graded group satisfying the minimal condition on subgroups which are not locally supersoluble, then $g$ is either locally supersoluble or a vcernikov group. the same conclusion holds for locally finite groups satisfying the weak minimal condition on non-(locally supersoluble) subgroups. as a consequence, it is shown that any infinite locally graded gro...
We study the Laplacian and the corresponding heat flow on an infinite, locally finite graph with possibly unbounded valence.
A colouring of a graph G is called distinguishing if its stabiliser in AutG is trivial. It has been conjectured that, if every automorphism of a locally finite graph moves infinitely many vertices, then there is a distinguishing 2-colouring. We study properties of random 2-colourings of locally finite graphs and show that the stabiliser of such a colouring is almost surely nowhere dense in AutG...
Let X be a locally finite tree and let G = Aut(X). Then G is naturally a locally compact group. A discrete subgroup Γ ≤ G is called an X-lattice, or a tree lattice if Γ has finite covolume in G. The lattice Γ is encoded in a graph of finite groups of finite volume. We describe several methods for constructing a pair of X-lattices (Γ′,Γ) with Γ ≤ Γ′, starting from ‘edgeindexed graphs’ (A′, i′) a...
A graph G is a couple G = (V, E) where V denotes the set of vertices of G and V the set of undirected edges. We will assume that the graphs considered are simple, that is they do not have multiple edge nor loop. The degree deg(v) of a vertex v of G is the number of edges attached to v. In the following except explicitly mentioned all the graphs considered are locally finite (no vertex of infini...
This paper deals with the relations between graph automorphisms and direct factors of a semimodular lattice of locally finite length.
We introduce the labelling map and the quasi-free action of a locally compact abelian group on a graph C∗-algebra of a row-finite directed graph. Some necessary conditions for embedding the crossed product to an AF algebra are discussed, and one sufficient condition is proved that if the row-finite directed graph is constructed by possibly attaching some 1-loops to a row-finite directed graph w...
We study the simplest variant of the cops and robbers game, where one cop tries to catch one robber by moving along the edges of a graph. A well known result connected to this game is that on a finite graph the cop has a winning strategy if and only if the graph is constructible. Chastand et al. proposed the notion of weakly cop-win graphs which they thought could lead to a generalisation of th...
Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersection of each family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an elem...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید