Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...

For a graph G with vertex set V(G) = {v1, v2, . . . , vn}, the extended double cover G∗ is a bipartite graph with bipartition (X, Y), X = {x1, x2, . . . , xn} and Y = {y1, y2, . . . , yn}, where two vertices xi and yj are adjacent if and only if i = j or vi adjacent to vj in G. The double graphD[G] of G is a graph obtained by taking two copies of G and joining each vertex in one copy with the n...

Abstract. Certain facts about frames and generalized frames (g- frames) are extended for the g-frames for Hilbert C*-modules. It is shown that g-frames for Hilbert C*-modules share several useful properties with those for Hilbert spaces. The paper also character- izes the operators which preserve the class of g-frames for Hilbert C*-modules. Moreover, a necessary and suffcient condition is ob- ...

‎in this paper‎, ‎we obtain exact solutions involving parameters of some nonlinear pdes in mathmatical physics; namely the one-‎dimensional modified complex ginzburg-landau equation by using the $ (g^{'}/g) $ expansion method‎, homogeneous balance method, extended f-expansion method‎. ‎by ‎using homogeneous balance principle and the extended f-expansion, more periodic wave solutions expres...