نتایج جستجو برای: gamma open set
تعداد نتایج: 1134370 فیلتر نتایج به سال:
in this study, we investigate the further properties of quasi irresolute topological groupsde ned in [20]. we show that if a group homomorphism f between quasi irresolute topologicalgroups is irresolute at eg, then f is irresolute on g. later we prove that in a semi-connectedquasi irresolute topological group (g; ; ), if v is any symmetric semi-open neighborhood ofeg, then g is generated by v...
Let $G$ be a finite group. The prime graph of $G$ is a graph $Gamma(G)$ with vertex set $pi(G)$, the set of all prime divisors of $|G|$, and two distinct vertices $p$ and $q$ are adjacent by an edge if $G$ has an element of order $pq$. In this paper we prove that if $Gamma(G)=Gamma(G_2(5))$, then $G$ has a normal subgroup $N$ such that $pi(N)subseteq{2,3,5}$ and $G/Nequiv G_2(5)$.
A graph $G=(V,E)$ is $\gamma$-excellent if $V$ a union of all $\gamma$-sets $G$, where $\gamma$ stands for the domination number. Let $\mathcal{I}$ be set mutually nonisomorphic graphs and $\emptyset \not= \mathcal{H} \subsetneq \mathcal{I}$. In this paper we initiate study $\mathcal{H}$-$\gamma$-excellent graphs, which define as follows. $G$ following hold: (i) every $H \in \mathcal{H}$ each $...
in this paper, using pre-semi-open l-sets and their inequality, a new notion of ps-compactness is introduced in l-topological spaces, where l is a complete de morgan algebra. this notion does not depend on the structure of the basis lattice l and l does not need any distributivity.
In conventional recognition tasks, models are only trained to recognize learned targets, but it is usually difficult collect training examples of all potential categories. the testing phase, when receive test samples from unknown classes, they mistakenly classify into known classes. Open set (OSR) a more realistic task, which requires classifier detect while keeping high classification accuracy...
in a graph g = (v,e), a subset s v is said to be an open packing set if no two vertices of s have a common neighbour in g. the maximum cardinality of an open packing set is called the open packing number and is denoted by rho^o. this paper further studies on this parameter by obtaining some new bounds.
A $Gamma$-so-ring is a structure possessing a natural partial ordering, an infinitary partial addition and a ternary multiplication, subject to a set of axioms. The partial functions under disjoint-domain sums and functional composition is a $Gamma$-so-ring. In this paper we introduce the notions of subdirect product and $(phi,rho)$-product of $Gamma$-so-rings and study $(phi,rho)$-represen...
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید