Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Mehdi Alaeiyan"'
Autor:
Xiujun Zhang, H. G. Govardhana Reddy, Arcot Usha, M. C. Shanmukha, Mohammad Reza Farahani, Mehdi Alaeiyan
Publikováno v:
Mathematical Biosciences and Engineering, Vol 20, Iss 2, Pp 3594-3609 (2023)
The use of topological descriptors is the key method, regardless of great advances taking place in the field of drug design. Descriptors portray the chemical characteristic of a molecule in numerical form, that is used for QSAR/QSPR models. The numer
Externí odkaz:
https://doaj.org/article/34b854cbd5734426bac3b580e1f5e7d3
Publikováno v:
International Journal of Group Theory, Vol 11, Iss 4, Pp 259-270 (2022)
A graph $X$ is symmetric if its automorphism group is transitive on the arc set of the graph. Let $p$ and $q$ be two prime integers. In this paper, a complete classification is determined of connected pentavalent symmetric graphs of
Externí odkaz:
https://doaj.org/article/8a8060cf65054d2a9dd6b621b2a055c8
Autor:
Mehdi Alaeiyan, Ayoob Mehrabani
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 380-386 (2020)
Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect -coloring of a graph with colors is a partition of the vertex set of into m parts , . . . , such that, for all , every vertex of is adjacent
Externí odkaz:
https://doaj.org/article/770e1ab584cc4e439eaadc7ea4ca8a87
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
A dendrimer is an artificially manufactured or synthesized molecule built up from branched units called monomers. In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Narumi–Katayama index and its modified
Externí odkaz:
https://doaj.org/article/a31913d8cf1b429c8529fc6d6d7df0d9
Autor:
Mehdi Alaeiyan, Ayoob Mehrabani
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 5, Iss 2, Pp 194-206 (2017)
Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect m-coloring of a graph G with m colors is a partition of the vertex set of G into m parts A_1, A_2, ..., A_m such that, for all $ i,j \in \lbr
Externí odkaz:
https://doaj.org/article/1b973eb933d94636a08dbaa381c80d36
Publikováno v:
Advances in Materials Science and Engineering, Vol 2019 (2019)
In this paper, we computed the topological indices of pent-heptagonal nanosheet. Formulas for atom-bond connectivity index, fourth atom-bond connectivity index, Randić connectivity index, sum-connectivity index, first Zagreb index, second Zagreb ind
Externí odkaz:
https://doaj.org/article/7decb24926df4f6d9408a941bc534f38
Autor:
Mehdi Alaeiyan
Publikováno v:
International Journal of Industrial Engineering and Production Research, Vol 19, Iss 1, Pp 1-11 (2008)
We call a Clayey graph Γ = Cay(G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aunt(Γ). in this paper, we give a classification of all non-normal Clayey graphs of finite abelian group wi
Externí odkaz:
https://doaj.org/article/07b283e3f4084f9b9db576a4aec8b151
Publikováno v:
Kuwait Journal of Science, Vol 41, Iss 1 (2014)
Omega polynomial of a graph G is defined, on the ground of "opposite edge strips" ops: where is the number of ops strips of length . The Sadhana polynomial can also be calculated by ops counting. In this paper we compute these polynomials for polyomi
Externí odkaz:
https://doaj.org/article/c28f2a04072549319297a5e176fbdc17
Autor:
Mehdi Alaeiyan, Ayoob Mehrabani
Publikováno v:
Armenian Journal of Mathematics. 10:1-11
Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect $m$-coloring of a graph $G$ with $m$ colors is a partition of the vertex set of $G$ into m parts $A_1$, $\dots$, $A_m$ such that, for all $ i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c87acbff2ee3c173ec2d3a695819aa69
https://doi.org/10.52737/18291163-2018.10.2-1-11
https://doi.org/10.52737/18291163-2018.10.2-1-11
Autor:
Muhammad Waheed, Umair Saleem, Murat Cancan, Ziyattin Tas, Mehdi Alaeiyan, Mohammad Reza Farahani
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 25:1525-1534
Graph product yields a new structure from two initial given structures. The computation of topological indices for these sophisticated structures using the graph product is a critical endeavor. Petersen graph is a structure which consists of ten vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::884f72d5b6554756fa52c701d30b0f40
https://doi.org/10.1080/09720529.2022.2060921
https://doi.org/10.1080/09720529.2022.2060921