نتایج جستجو برای: locally finite graph

تعداد نتایج: 514983  

2005
Michael Giudici Cai Heng Li Cheryl E. Praeger

Let Γ be a finite locally (G, s)-arc transitive graph with s ≥ 2 such that G is intransitive on vertices. Then Γ is bipartite and the two parts of the bipartition are G-orbits. In previous work the authors showed that if G has a nontrivial normal subgroup intransitive on both of the vertex orbits of G, then Γ is a cover of a smaller locally s-arc transitive graph. Thus the “basic” graphs to stu...

Journal: :Eur. J. Comb. 2016
Karl Heuer

Among the well-known sufficient degree conditions for the Hamiltonicity of a finite graph, the condition of Asratian and Khachatrian is the weakest and thus gives the strongest result. Diestel conjectured that it should extend to locally finite infinite graphs G, in that the same condition implies that the Freudenthal compactification of G contains a circle through all its vertices and ends. We...

2009
MARKUS LOHREY BENJAMIN STEINBERG

We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which socalled benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups in which edge groups are polycyclic-by-finite and vertex groups are either locally quasiconvex hyperbolic or polycyclic-by-finite and so in particular chordal...

Journal: :Canadian Journal of Mathematics 1955

Journal: :international journal of group theory 2014
xuan long ma hua quan wei li ying yang

the coprime graph $gg$ with a finite group $g$‎ ‎as follows‎: ‎take $g$ as the vertex set of $gg$ and join two distinct‎ ‎vertices $u$ and $v$ if $(|u|,|v|)=1$‎. ‎in the paper‎, ‎we explore how the graph‎ ‎theoretical properties of $gg$ can effect on the group theoretical‎ ‎properties of $g$‎.

Journal: :J. Comb. Theory, Ser. B 2006
Henning Bruhn Maya Jakobine Stein

MacLane’s planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B. Solving a problem of Wagner (1970), we show that the topological cycle space introduced recently by Diestel and Kühn allows a verbatim generalisation of MacLane’s criterion to locally finite graphs. This then enables us to...

1996
Piotr Rudnicki

The graph induced by a many sorted signature is defined as follows: the vertices are the symbols of sorts, and if a sort s is an argument of an operation with result sort t, then a directed edge [s, t] is in the graph. The key lemma states relationship between the depth of elements of a free many sorted algebra over a signature and the length of directed chains in the graph induced by the signa...

Journal: :CoRR 2005
Pascal O. Vontobel Ralf Koetter

The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in maximum-likelihood decoding all codewords in a code are competing to be the best explanation of the received vector, under graph-cover decoding all codewords...

Journal: :journal of sciences, islamic republic of iran 2014
b. tolue a. erfanian a. jafarzadeh

let g be a fixed element of a finite group g. we introduce the g-noncommuting graph of g whose vertex set is whole elements of the group g and two vertices x,y are adjacent whenever [x,y] g  and  [y,x] g. we denote this graph by . in this paper, we present some graph theoretical properties of g-noncommuting graph. specially, we investigate about its planarity and regularity, its clique number a...

Let $R$ be a ring (not necessarily commutative) with nonzero identity. We define $Gamma(R)$ to be the graph with vertex set $R$ in which two distinct vertices $x$ and $y$ are adjacent if and only if there exist unit elements $u,v$ of $R$ such that $x+uyv$ is a unit of $R$. In this paper, basic properties of $Gamma(R)$ are studied. We investigate connectivity and the girth of $Gamma(R)$, where $...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید