Zobrazeno 1 - 10
of 339
pro vyhledávání: '"Ghasemi Mohsen"'
On the way to advance the sensing technology, various strategies based on the nano-materials have been introduced to improve the performance of the gas sensors. In this study, we have introduced a facile fabrication procedure for annealing hematite t
Externí odkaz:
http://arxiv.org/abs/2302.14663
Autor:
Ghasemi Mohsen
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 3, Pp 567-575 (2014)
Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on (s + 1)-arcs. Let p be a prime. In this article a complete classification of tetravalent s-transitive graphs of order 3p2 is given
Externí odkaz:
https://doaj.org/article/399091ba23ad446e91ea59568f45e254
Autor:
Seyed Ghafur Mousavi, Ghasemi Mohsen, Maracy M Reza, Ebrahimi Amrollah, Barekatain Majid, Noori Fariba
Publikováno v:
International Journal of Preventive Medicine, Vol 3, Iss 7, Pp 499-503 (2012)
Background: Electroconvulsive therapy (ECT) is one of the most efficacious treatment for major depressive disorder (MDD), it is also used as a rapid and efficacious treatment for other psychiatric disorders, especially treatment resistant ones. The c
Externí odkaz:
https://doaj.org/article/71604c39e7074cfb9a65980fe8c52663
Let $s$ be a positive integer. A graph is $s$-transitive if its automorphism group is transitive on s-arcs but not on $(s + 1)$-arcs. In this paper, we study all tetravalent s-transitive graphs of order $6p^2$.
Externí odkaz:
http://arxiv.org/abs/2210.00352
A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the tetraval
Externí odkaz:
http://arxiv.org/abs/2203.04392
Autor:
Ghasemi, Mohsen, Varmazyar, Rezvan
A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper, $4$-valent one-regular graphs of order $5p^2$, where $p$ is a prime, are classified
Externí odkaz:
http://arxiv.org/abs/2108.04361
Publikováno v:
In Materials Chemistry and Physics 1 May 2024 318
Let $G$ be a finite group and ${\rm cd}(G)$ will be the set of the degrees of the complex irreducible characters of $G$. Also let ${\rm cod}(G)$ be the set of codegrees of the irreducible characters of $G$. The Taketa problem conjectures if $G$ is so
Externí odkaz:
http://arxiv.org/abs/2107.00735
Autor:
Ghasemi, Mohsen, Hekmatara, Somayeh
In this note we verify the equivalent version of Huppert's conjecture for $K_3$-groups.
Externí odkaz:
http://arxiv.org/abs/2104.04861
For a graph $G$, $k(G)$ denotes its connectivity. A graph is super connected if every minimum vertex-cut isolates a vertex. Also $k_{1}$-connectivity of a connected graph is the minimum number of vertices whose deletion gives a disconnected graph wit
Externí odkaz:
http://arxiv.org/abs/2009.04831