Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Reza Akhtar"'
Autor:
Harshavardhan Sanekommu, Sobaan Taj, Rida Mah Noor, Muhammad Umair Akmal, Reza Akhtar, Mohammad Hossain, Arif Asif
Publikováno v:
Clinics and Practice, Vol 13, Iss 4, Pp 881-888 (2023)
Chronic kidney disease (CKD) is a global health challenge affecting nearly 700 million people worldwide. In the United States alone, the Medicare costs for CKD management has reached nearly USD 80 billion per year. While reversing CKD may be possible
Externí odkaz:
https://doaj.org/article/10b375d0ef3748be89574cfdb6a4422a
Autor:
Reza Akhtar, Mujtaba Mohamed, Arif Asif, Eugene Zurkovsky, Nikolaos Pyrsopoulos, Mohammad A. Hossain, Min Zheng, Alsadiq Al Hillan
Publikováno v:
Journal of Medical Cases
Signet ring cell carcinoma (SRCC) represents an extremely rare histological type for colon cancer, accounting for less than 1% of all colon neoplasms. SRCC is usually aggressive and it is associated with poor prognosis. It can be divided into mucinou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbe679ca437ebf501636c848469b8482
http://europepmc.org/articles/PMC8383561
http://europepmc.org/articles/PMC8383561
Publikováno v:
Cureus.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abb5369d0d7ec568b14f46a8e8f6eadc
https://doi.org/10.7759/cureus.21900
https://doi.org/10.7759/cureus.21900
Autor:
Stephen M. Gagola, Reza Akhtar
Publikováno v:
Discrete Mathematics. 345:112643
A strong complete mapping for a group G is a bijection φ : G → G such that the maps x ↦ x φ ( x ) and x ↦ x − 1 φ ( x ) are also bijections. Groups admitting a strong complete mapping are important to the study of orthogonality problems fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02ea92e79a1e2398a62e2f7449437063
https://doi.org/10.1016/j.disc.2021.112643
https://doi.org/10.1016/j.disc.2021.112643
Publikováno v:
Involve 9, no. 5 (2016), 737-750
Using ideal-splitting techniques, we prove a recursive formula relating the Betti numbers of the secant powers of the edge ideal of a graph [math] to those of the join of [math] with a finite independent set. We apply this result in conjunction with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58279973748ce2d4cf27ea595844125c
https://doi.org/10.2140/involve.2016.9.737
https://doi.org/10.2140/involve.2016.9.737
Autor:
Reza Akhtar, Maxwell Forlini
Publikováno v:
Discrete Applied Mathematics. 171:1-8
Let S be a finite set and S a complete Sperner family on S , i.e. a Sperner family such that every x ∈ S is contained in some member of S . The linear chromatic number of S , defined by Civan, is the smallest integer n with the property that there
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2c582424d1f6bf484448cec7acd0955
https://doi.org/10.1016/j.dam.2014.02.003
https://doi.org/10.1016/j.dam.2014.02.003
Publikováno v:
American Journal of Gastroenterology. 113:S1675-S1676
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95f8274a339c14d9b0a96b61036a9dfd
https://doi.org/10.14309/00000434-201810001-03064
https://doi.org/10.14309/00000434-201810001-03064
Autor:
Reza Akhtar, Lucas Lee
Publikováno v:
Involve 9, no. 3 (2016), 415-422
We study the vertex-connectivity and edge-connectivity of the zero-divisor graph [math] associated to a finite commutative ring [math] . We show that the edge-connectivity of [math] always coincides with the minimum degree, and that vertex-connectivi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20667aa1a59e524924997e1cfaee2101
https://projecteuclid.org/euclid.involve/1511371022
https://projecteuclid.org/euclid.involve/1511371022
Autor:
Reza Akhtar
Publikováno v:
Discrete Mathematics. 312(22):3417-3423
We study the representation number for some special sparse graphs. For graphs with a single edge and for complete binary trees we give an exact formula, and for hypercubes we improve the known lower bound. We also study the prime factorization of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98345aed7db0788f9e6ac6a7f16fb792
Publikováno v:
Discrete Mathematics. 312(6):1158-1165
A graph G has a representation modulo r if there exists an injective map f:V(G)→{0,1,…,r−1} such that vertices u and v are adjacent if and only if f(u)−f(v) is relatively prime to r. The representation number rep(G) is the smallest r such tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9b2fcc11c38e67c03715db109ee7cc5