R andom numbers have applications in many areas: simulation, game-playing, cryptography, statistical sampling, evaluation of multiple integrals, particletransport calculations, and computations in statistical physics, to name a few. Since each application involves slightly different criteria for judging the “worthiness” of the random numbers generated, a variety of generators have been develope...

The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the number of pairs of edges that intersect an odd number of times, we obtain the odd crossing number. We show that there is a graph for which these two concepts differ, answering a well-known open question on crossing numbe...

the aim of this paper is to classify the finite simple groups with the number of zeros at most seven greater than the number of nonlinear irreducible characters in the character tables. we find that they are exactly a$_{5}$, l$_{2}(7)$ and a$_{6}$.

The dichromatic number of a graph G is the maximum integer k such that there exists an orientation of the edges of G such that for every partition of the vertices into fewer than k parts, at least one of the parts must contain a directed cycle under this orientation. In 1979, Erdős and NeumannLara conjectured that if the dichromatic number of a graph is bounded, so is its chromatic number. We m...

let $m$ be an $r$-module and $0 neq fin m^*={rm hom}(m,r)$. we associate an undirected graph $gf$ to $m$ in which non-zero elements $x$ and $y$ of $m$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. weobserve that over a commutative ring $r$, $gf$ is connected anddiam$(gf)leq 3$. moreover, if $gamma (m)$ contains a cycle,then $mbox{gr}(gf)leq 4$. furthermore if $|gf|geq 1$, then$gf$ is finit...

the idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as latin squares, block designs and steiner systems in combinatorics (see [1] and the references therein). recently, the forcing on perfect matchings has been attracting more researchers attention. a forcing set of m is a subset of m contained...

In this paper, we show that every element of a discrete module is a sum of two units if and only if its endomorphism ring has no factor ring isomorphic to $Z_{2}$. We also characterize unit sum number equal to two for the endomorphism ring of quasi-discrete modules with finite exchange property.

The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...