نتایج جستجو برای: locally finite graph
تعداد نتایج: 514983 فیلتر نتایج به سال:
Bonnington and Richter defined the cycle space of an infinite graph to consist of the sets of edges of subgraphs having even degree at every vertex. Diestel and Kühn introduced a different cycle space of infinite graphs based on allowing infinite circuits. A more general point of view was taken by Vella and Richter, thereby unifying these cycle spaces. In particular, different compactifications...
let $g$ be a finite group which is not a cyclic $p$-group, $p$ a prime number. we define an undirected simple graph $delta(g)$ whose vertices are the proper subgroups of $g$, which are not contained in the frattini subgroup of $g$ and two vertices $h$ and $k$ are joined by an edge if and only if $g=langle h , krangle$. in this paper we classify finite groups with planar graph. ...
given a non-abelian finite group $g$, let $pi(g)$ denote the set of prime divisors of the order of $g$ and denote by $z(g)$ the center of $g$. thetextit{ prime graph} of $g$ is the graph with vertex set $pi(g)$ where two distinct primes $p$ and $q$ are joined by an edge if and only if $g$ contains an element of order $pq$ and the textit{non-commuting graph} of $g$ is the graph with the vertex s...
We associate a graph ΓG to a non locally cyclic group G (called the non-cyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G | 〈x, y〉 is cyclic for all y ∈ G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and we establish some graph theoretical properties (such as regularity) of this graph in terms of the gro...
Abstract. Let AE be the canonical AF subalgebra of a graph C ∗-algebra C∗(E) associated with a locally finite directed graph E. For Brown-Voiculescu’s topological entropy ht(ΦE) of the canonical completely positive map ΦE on C∗(E), ht(ΦE) = ht(ΦE |AE ) = hl(E) = hb(E) is known to hold for a finite graph E, where hl(E) is the loop entropy of Gurevic and hb(E) is the block entropy of Salama. For ...
An r-identifying code on a graph G is a set C ⊂ V (G) such that for every vertex in V (G), the intersection of the radius-r closed neighborhood with C is nonempty and unique. On a finite graph, the density of a code is |C|/|V (G)|, which naturally extends to a definition of density in certain infinite graphs which are locally finite. We present new lower bounds for densities of codes for some s...
An r-identifying code on a graph G is a set C ⊂ V (G) such that for every vertex in V (G), the intersection of the radius-r closed neighborhood with C is nonempty and unique. On a finite graph, the density of a code is |C|/|V (G)|, which naturally extends to a definition of density in certain infinite graphs which are locally finite. We present new lower bounds for densities of codes for some s...
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is wellknown. A general result is obtained for such graphs where no restriction is put on the number of ends. It is shown that such a graph can be built up from one-ended or finite pla...
It has been conjectured by Cowan and Emerson [3] that every graph has an unfriendly partition; i.e., there is a partition of the vertex set V= V, v V, such that every vertex of V, is joined to at least as many vertices in V, _, as to vertices in V,. It is easily seen that every rinite graph has such a partition, and hence by compactness so does any locally finite graph. We show that the conject...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید