نتایج جستجو برای: g regular
تعداد نتایج: 555121 فیلتر نتایج به سال:
We consider the (Ihara) zeta functions of line graphs, middle graphs and total graphs of a regular graph and their (regular or irregular) covering graphs. Let L(G), M(G) and T (G) denote the line, middle and total graph of G, respectively. We show that the line, middle and total graph of a (regular and irregular, respectively) covering of a graph G is a (regular and irregular, respectively) cov...
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
For any group G and any set A, a cellular automaton (CA) is a transformation of the configuration space A G defined via a finite memory set and a local function. Let CA(G; A) be the monoid of all CA over A G. In this paper, we investigate a generalisation of the inverse of a CA from the semigroup-theoretic perspective. An element τ ∈ CA(G; A) is von Neumann regular (or simply regular) if there ...
a set $s$ of vertices of a graph $g=(v,e)$ without isolated vertex is a {em total dominating set} if every vertex of $v(g)$ is adjacent to some vertex in $s$. the {em total domatic number} of a graph $g$ is the maximum number of total dominating sets into which the vertex set of $g$ can be partitioned. we show that the total domatic number of a random $r$-regular graph is almost...
Let $G$ be a group and $A$ a set. A cellular automaton (CA) $\tau$ over $A^G$ is von Neumann regular (vN-regular) if there exists a CA $\sigma$ over $A^G$ such that $\tau \sigma\tau = \tau$, and in such case, $\sigma$ is called a generalised inverse of $\tau$. In this paper, we investigate vN-regularity of various kinds of CA. First, we establish that, over any nontrivial configuration space, t...
We call a Clayey graph Γ = Cay(G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aunt(Γ). in this paper, we give a classification of all non-normal Clayey graphs of finite abelian group with valency 6.
r is called commuting regular ring (resp. semigroup) if for each x,y $in$ r thereexists a $in$ r such that xy = yxayx. in this paper, we introduce the concept of commuting$pi$-regular rings (resp. semigroups) and study various properties of them.
The well-known Moore bound M(k, g) serves as a universal lower bound for the order of k-regular graphs of girth g. The excess e of a k-regular graph G of girth g and order n is the difference between its order n and the corresponding Moore bound, e = n −M(k, g). We find infinite families of parameters (k, g), g > 6 and even, for which we show that the excess of any k-regular graph of girth g is...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید