Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$,  if no two vertices of $S$ are adjacent.The  independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.

‎For any integer $kgeq 1$‎, ‎a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-‎tuple total dominating set of $G$ if any vertex‎ ‎of $G$ is adjacent to at least $k$ vertices in $S$‎, ‎and any vertex‎ ‎of $V-S$ is adjacent to at least $k$ vertices in $V-S$‎. ‎The minimum number of vertices of such a set‎ ‎in $G$ we call the $k$-tuple total restrained domination number of $G$‎. ‎The maximum num...

‎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‎...

‎for any integer $kgeq 1$‎, ‎a set $s$ of vertices in a graph $g=(v,e)$ is a $k$-‎tuple total dominating set of $g$ if any vertex‎ ‎of $g$ is adjacent to at least $k$ vertices in $s$‎, ‎and any vertex‎ ‎of $v-s$ is adjacent to at least $k$ vertices in $v-s$‎. ‎the minimum number of vertices of such a set‎ ‎in $g$ we call the $k$-tuple total restrained domination number of $g$‎. ‎the maximum num...

In Pān. ini’s grammar one finds the Śivasūtras, a table which defines the natural classes of phonological segments in Sanskrit by intervals. We present a formal argument which shows that, using his representation method, Pān. ini has chosen an optimal way of ordering the phonological segments to represent the natural classes. The argument is based on a strict settheoretical point of view depend...

An S-type singular value inclusion set for rectangular tensors is given. Based on the set, new upper and lower bounds for the largest singular value of nonnegative rectangular tensors are obtained and proved to be sharper than some existing results. Numerical examples are given to verify the theoretical results.

Grid environment is a service oriented infrastructure in which many heterogeneous resources participate to provide the high performance computation. One of the bug issues in the grid environment is the vagueness and uncertainty between advertised resources and requested resources. Furthermore, in an environment such as grid dynamicity is considered as a crucial issue which must be dealt with. C...

We use the method of the tensor product graph to construct rational (Yangian invariant) solutions of the Yang-Baxter equation in fundamental representations of cn and thence the full set of cn-invariant factorized S-matrices. February 1, 2008 Supported by a U.K. Science and Engineering Research Council studentship. Address from 1st August: RIMS, Kyoto Univ., Kyoto 606, Japan. Integrable quantum...

‎‎Let $G=(V‎, ‎E)$ be a simple graph with vertex set $V$ and edge set $E$‎. ‎A {em mixed Roman dominating function} (MRDF) of $G$ is a function $f:Vcup Erightarrow {0,1,2}$ satisfying the condition that every element $xin Vcup E$ for which $f(x)=0$ is adjacent‎‎or incident to at least one element $yin Vcup E$ for which $f(y)=2$‎. ‎The weight of an‎‎MRDF $f$ is $sum _{xin Vcup E} f(x)$‎. ‎The mi...

‎‎In this paper‎, ‎we define fuzzy subnexuses over a nexus $N$‎. ‎Define and study the notions of the prime fuzzy subnexuses and the fractions‎‎induced by them‎. ‎Finally‎, ‎we show that if S is a meet‎‎closed subset of the set Fsub(N), ‎of fuzzy subnexuses of a nexus N‎, ‎and‎‎h= ⋀S ϵ S, ‎then the fractions S^-1 N and h^-1 N are isomorphic as meet-semilattices‎.