نتایج جستجو برای: semisymmetric manifold
تعداد نتایج: 30386 فیلتر نتایج به سال:
The object of the present paper is to introduce and study a type of non-flat semi-Riemannian manifolds, called, super generalized recurrent manifolds which generalizes both the notion of hyper generalized recurrent manifolds [A.A. Shaikh and A. Patra, On a generalized class of recurrent manifolds, Arch. Math. (Brno) 46 (2010) 71--78.] and weakly generalized recurrent manifolds ...
In this paper, we consider $\left(LCS\right)_{n}$ manifold admitting almost $\eta-$Ricci solitons by means of curvature tensors. Ricci pseudosymmetry concepts soliton have introduced according to the choice some special tensors such as pseudo-projective, $W_{1}$, $W_{1}^{\ast}$ and $W_{2}.$ Then, again tensor, necessary conditions are searched for be semisymmetric. Then characterizations obtain...
In this paper, we investigate semisymmetric graphs which arise from affine primitive permutation groups. We give a characterization of such graphs, and then construct an infinite family of semisymmetric graphs which contains the Gray graph as the third smallest member. Then, as a consequence, we obtain a factorization of the complete bipartite graph Kpspt ,psp into connected semisymmetric graph...
A regular and edge transitive graph which is not vertex transitive is said to be semisymmetric Every semisymmetric graph is necessarily bipartite with the two parts having equal size and the automorphism group acting transitively on each of these two parts A semisymmet ric graph is called biprimitive if its automorphism group acts prim itively on each part In this paper a classi cation of bipri...
A regular and edge-transitive graph which is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these parts. A semisymmetric graph is called biprimitive if its automorphism group acts primitively on each part. In this paper biprimitive graphs of smal...
In this paper, we consider Lorentzian para-Kenmotsu manifold admitting almost $\eta-$Ricci solitons by virtue of some curvature tensors. Ricci pseudosymmetry concepts manifolds soliton have introduced according to the choice tensors such as Riemann, concircular, projective, $\mathcal{M-}$projective, $W_{1}$ and $W_{2}.$ After then, tensors, necessary conditions are given for be semisymmetric. T...
A regular graph is called semisymmetric if it is edge-transitive but not vertex-transitive. It is proved that the Gray graph is the only cubic semisymmetric graph of order 2p3, where p 3 is a prime.
A regular graph is called semisymmetric if it is edge transitive but not vertex transitive It is proved that the Gray graph is the only cubic semisymmetric graph of order p where p is a prime
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a huge usage of such graphs. Constructing symmetric and semisymmetric graphs is a large and hard problem. In this paper a tool called G-graphs and based on group theory is used. We show the efficiency of this tool for cons...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید