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

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

By the Von Neumann regular graph of R, we mean the graph that its vertices are all elements of R such that there is an edge between vertices x,y if and only if x+y is a von Neumann regular element of R, denoted by G_Vnr (R). For a commutative ring R with unity, x in R is called Von Neumann regular if there exists x in R such that a=a2 x. We denote the set of Von Neumann regular elements by V nr...

Let C?(E) be the graph C?-algebra of a row-finite E. We give complete description vertex sets gauge-invariant regular ideals C?(E). It is shown that when E satisfies condition (L), are class which preserve (L) under quotients. That is, we show if then ideal J?C?(E) necessarily gauge-invariant. Further, ideal, it C?(E)?J?C?(F), where F (L).