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

We have been investigating an approach to parallel database processing based on treating Entity-Relationship (E-R) schema graphs as datallow graphs. A prerequisite is to find appropriate embeddings of the schema graphs into a processor graph, in this case a hypercube. This paper studies a class of adjacency preserving embeddings that map a node in the schema graph into a subcube (relaxed squash...

the notion of a probabilistic metric  space  corresponds to thesituations when we do not know exactly the  distance.  probabilistic metric space was  introduced by karl menger. alsina, schweizer and sklar gave a general definition of  probabilistic normed space based on the definition of menger [1]. in this note we study the pn spaces which are  topological vector spaces and the open mapping an...

the main goal of this paper is to introduce and study a new class of function via the notions of $e$-$theta$-open sets and $e$-$theta$-closure operator which are defined by özkoç and aslım cite{10} called weakly $er$-open functions and $e$-$theta$-open functions. moreover, we investigate not only some of their basic properties but also their relationships with other types of already existing to...

Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...

For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...

Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.

For a graph G with vertex set V (G) = {v1, v2, . . . , vn}, let S be the covering set of G having the maximum degree over all the minimum covering sets of G. Let NS[v] = {u ∈ S : uv ∈ E(G)} ∪ {v} be the closed neighbourhood of the vertex v with respect to S. We define a square matrix AS(G) = (aij), by aij = 1, if |NS[vi] ∩NS[vj]| ≥ 1, i 6= j and 0, otherwise. The graph G associated with the mat...

A vertex-magic group edge labeling of a graph G(V,E) with |E| = n is an injection from E to an abelian group Γ of order n such that the sum of labels of all incident edges of every vertex x ∈ V is equal to the same element μ ∈ Γ. We completely characterize all Cartesian products Cn Cm that admit a vertex-magic group edge labeling by Z2nm, as well as provide labelings by a few other finite abeli...