Displaying 381 – 400 of 430

Showing per page

T-Rickart modules

S. Ebrahimi Atani, M. Khoramdel, S. Dolati Pish Hesari (2012)

Colloquium Mathematicae

We introduce the notions of T-Rickart and strongly T-Rickart modules. We provide several characterizations and investigate properties of each of these concepts. It is shown that R is right Σ-t-extending if and only if every R-module is T-Rickart. Also, every free R-module is T-Rickart if and only if R = Z ( R R ) R ' , where R’ is a hereditary right R-module. Examples illustrating the results are presented.

Undirected and directed graphs with near polynomial growth

V.I. Trofimov (2003)

Discussiones Mathematicae Graph Theory

The growth function of a graph with respect to a vertex is near polynomial if there exists a polynomial bounding it above for infinitely many positive integers. In the paper vertex-symmetric undirected graphs and vertex-symmetric directed graphs with coinciding in- and out-degrees are described in the case their growth functions are near polynomial.

Valency seven symmetric graphs of order 2 p q

Xiao-Hui Hua, Li Chen (2018)

Czechoslovak Mathematical Journal

A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, all connected valency seven symmetric graphs of order 2 p q are classified, where p , q are distinct primes. It follows from the classification that there is a unique connected valency seven symmetric graph of order 4 p , and that for odd primes p and q , there is an infinite family of connected valency seven one-regular graphs of order 2 p q with solvable automorphism groups, and there are four sporadic ones...

Value sets of graphs edge-weighted with elements of a finite abelian group

Edgar G. DuCasse, Michael L. Gargano, Louis V. Quintas (2010)

Discussiones Mathematicae Graph Theory

Given a graph G = (V,E) of order n and a finite abelian group H = (H,+) of order n, a bijection f of V onto H is called a vertex H-labeling of G. Let g(e) ≡ (f(u)+f(v)) mod H for each edge e = u,v in E induce an edge H-labeling of G. Then, the sum H v a l f ( G ) e E g ( e ) m o d H is called the H-value of G relative to f and the set HvalS(G) of all H-values of G over all possible vertex H-labelings is called the H-value set of G. Theorems determining HvalS(G) for given H and G are obtained.

Word distance on the discrete Heisenberg group

Sébastien Blachère (2003)

Colloquium Mathematicae

We establish an exact formula for the word distance on the discrete Heisenberg group ℍ₃ with its standard set of generators. This formula is then used to prove the almost connectedness of the spheres for this distance.

Zero-divisors of content algebras

Peyman Nasehpour (2010)

Archivum Mathematicum

In this article, we prove that in content extentions minimal primes extend to minimal primes and discuss zero-divisors of a content algebra over a ring who has Property (A) or whose set of zero-divisors is a finite union of prime ideals. We also examine the preservation of diameter of zero-divisor graph under content extensions.

Currently displaying 381 – 400 of 430