Zobrazeno 1 - 10
of 109
pro vyhledávání: '"Alinaghipour A"'
Publikováno v:
مطالعات روانشناختی, Vol 20, Iss 1, Pp 103-117 (2024)
This research was conducted with the main purpose of investigating the effectiveness of cognitive behavioral therapy on positive thinking skills and interpersonal conflicts in children of divorce. The research design was semi-experimental (pre-test a
Externí odkaz:
https://doaj.org/article/c85123ad922549c19c43771be954d233
Publikováno v:
Discrete Mathematics Volume 343, Issue 9, September 2020, 111984
A vertex coloring of a graph $G$ is called distinguishing (or symmetry breaking) if no non-identity automorphism of $G$ preserves it, and the distinguishing number, shown by $D(G)$, is the smallest number of colors required for such a coloring. This
Externí odkaz:
http://arxiv.org/abs/1910.12102
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Life Sciences 15 July 2022 301
Autor:
Azam Alinaghipour, Mahmoud Salami, Esmail Riahi, Ghorbangol Ashabi, Masoud Soheili, Fatemeh Nabavizadeh
Publikováno v:
Stress, Vol 25, Iss 1, Pp 337-346 (2022)
The therapeutic activities of curcumin have long been investigated in some chronic and inflammatory diseases. This study was designed to investigate the protective effects of nanocurcumin on intestinal barrier function, apoptosis, and oxidative stres
Externí odkaz:
https://doaj.org/article/ac874ac2d4144b7aa2d89e101662e08a
Autor:
Valizadeh, Mehrdad, Derafsh, Ehsan, Abdi Abyaneh, Fahimeh, Parsamatin, Sayedeh Kiana, Noshabad, Fatemeh Zahra Rashidi, Alinaghipour, Azam, Yaghoobi, Zahra, Taheri, Abdolkarim Talebi, Dadgostar, Ehsan, Aschner, Michael, Mirzaei, Hamed, Tamtaji, Omid Reza, Nabavizadeh, Fatemeh
Publikováno v:
Molecular Neurobiology; Jul2024, Vol. 61 Issue 7, p4508-4537, 30p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
For any simple graph $G$ on $n$ vertices, the (positive semi-definite) minimum rank of $G$ is defined to be the smallest possible rank among all (positive semi-definite) real symmetric $n\times n$ matrices whose entry in position $(i,j)$, for $i\neq
Externí odkaz:
http://arxiv.org/abs/1311.7672
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph, while the p
Externí odkaz:
http://arxiv.org/abs/1311.7064
Autor:
Ahmadi, Bahman, Alinaghipour, Fatemeh, Cavers, Michael S., Fallat, Shaun, Meagher, Karen, Nasserasr, Shahla
The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph $G$, is denoted by $q(G)$. Using other parameters related to $G$, bounds for $q(G)$ are proven and then applied to deduce further propert
Externí odkaz:
http://arxiv.org/abs/1304.1205