Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Samaneh Hossein-Zadeh"'
Autor:
Hooshang Mirzaie, Seyed Ali Hosseini, Abbas Riazi, Fatemeh Ghasemi Fard, Mehdi Jafari Oori, Samaneh Hossein Zadeh, Narges Hooshmand Zadeh
Publikováno v:
Journal of Rehabilitation, Vol 21, Iss 1, Pp 88-105 (2020)
Objective: The integration of various senses with each other in the form of perceptual-motor activities can lead to the promotion of different aspects of physical, perceptual, cognitive, and psychosocial development. Decreased visual acuity in childr
Externí odkaz:
https://doaj.org/article/fbd3858ac5b84008b8cfd93c4bbed064
Publikováno v:
Transactions on Combinatorics, Vol 1, Iss 4, Pp 51-60 (2012)
The Hosoya index and the Merrifield-Simmons index are two types of graph invariants used in mathematical chemistry. In this paper, we give some formulas for computed these indices for some classes of corona product and link of two graphs. Furthermore
Externí odkaz:
https://doaj.org/article/152d82ca5d3248c6a5ce37d4c2dbadfc
Publikováno v:
Journal of Rehabilitation, Vol 13, Iss 1, Pp 47-57 (2012)
Objective: Present study compares relationship between motor performance, sustained attention and impulse control in children with Attention Deficit Hyperactivity Disorder and normal children. Materials & Methods: In this descriptive-analytic study,
Externí odkaz:
https://doaj.org/article/63f5f2b45efc4be5b0e27d5e5e7d21c9
Publikováno v:
Journal of Rehabilitation, Vol 12, Iss 3, Pp 44-52 (2011)
Objective: This research aimed at comparison effects of a new and current "training program for community rehabilitation workers of Community Based Rehabilitation", in enhancing their knowledge, attitude and skills. Materials & Methods: In this expe
Externí odkaz:
https://doaj.org/article/7b4920308f36451a95b9ec477a0a4c68
Publikováno v:
Linear Algebra and its Applications. 569:266-284
In a network or a graph, the total communicability (TC) has been defined as the sum of the entries in the exponential of the adjacency matrix of the network. This quantity offers a good measure of how easily information spreads across the network, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6b0d9e83cd0f8c1fdd916117f2e829a0
https://doi.org/10.1016/j.laa.2019.01.023
https://doi.org/10.1016/j.laa.2019.01.023
Given a finite group G , the character graph, denoted by Δ ( G ) , for its irreducible character degrees is a graph with vertex set ρ ( G ) which is the set of prime numbers that divide the irreducible character degrees of G , and with { p , q } be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1699a85dab77e83a97a35137c372d253
https://aperta.ulakbim.gov.tr/record/234520
https://aperta.ulakbim.gov.tr/record/234520
Publikováno v:
Journal of Health Promotion Managment. 6:55-62
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99e90342ae15f84069d2c9cf3ddcdfe7
https://doi.org/10.21859/jhpm-06018
https://doi.org/10.21859/jhpm-06018
Autor:
Asma Hamzeh, Ali Reza Ashrafi, Mohammad Ali Hosseinzadeh, Mostafa Tavakoli, Ali Iranmanesh, Samaneh Hossein-Zadeh
Publikováno v:
Journal of Applied Mathematics and Computing. 54:69-80
In this paper we present explicit formulas for computing the topological efficiency index of the most important graph operations such as the Cartesian product, composition, corona, join and hierarchical product of two graphs. We apply our results to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e242cfabd6365fa3188390291a1a75eb
https://doi.org/10.1007/s12190-016-0997-8
https://doi.org/10.1007/s12190-016-0997-8
Publikováno v:
Canadian Mathematical Bulletin. 58:105-109
The prime vertex graph, Δ(X), and the common divisor graph, Γ(X), are two graphs that have been deûned on a set of positive integers X. Some properties of these graphs have been studied in the cases where either X is the set of character degrees o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d8dd1be09b91968944d32205e44e732
https://doi.org/10.4153/cmb-2014-058-8
https://doi.org/10.4153/cmb-2014-058-8
Publikováno v:
Electronic Notes in Discrete Mathematics. 45:51-56
Let G be a simple graph with vertex set { v 1 , v 2 , … , v n } . The common neighborhood graph (congraph) of G, denoted by c o n ( G ) , is a graph with vertex set { v 1 , v 2 , … , v n } , in which two vertices are adjacent if and only if they
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29c0cb56dd5faa7290a38b6775b7b3de
https://doi.org/10.1016/j.endm.2013.11.011
https://doi.org/10.1016/j.endm.2013.11.011