Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Irfan, Rida"'
Ordinary Differential Equations (ODEs) are widely used in physics, chemistry, and biology to model dynamic systems, including reaction kinetics, population dynamics, and biological processes. In this work, we integrate GPU-accelerated ODE solvers int
Externí odkaz:
http://arxiv.org/abs/2411.19882
Autor:
Irfan, Rida, Shoukat, Nadia
Let $L$ be a distributive lattice and $R[L]$ the associated Hibi ring. We show that if $L$ is planar, then any bounded Hibi subring of $R[L]$ has a quadratic Gr\"obner basis. We characterize all planar distributive lattices $L$ for which any proper r
Externí odkaz:
http://arxiv.org/abs/1901.06690
Autor:
Chaudhry, Faryal, Irfan, Rida
We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.
Comment: 13 pages
Comment: 13 pages
Externí odkaz:
http://arxiv.org/abs/1709.07668
Let $I_G$ be the binomial edge ideal on the generic 2 x n - Hankel matrix associated with a closed graph $G$ on the vertex set [n]. We characterize the graphs $G$ for which $I_G$ has maximal regularity and is Gorenstein.
Comment: 14 pages; major
Comment: 14 pages; major
Externí odkaz:
http://arxiv.org/abs/1503.01950
Autor:
Zhao Dongming, Zahid Manzoor Ahmad, Irfan Rida, Arshad Misbah, Fahad Asfand, Ahmad Zahid, Li Li
Publikováno v:
Open Chemistry, Vol 19, Iss 1, Pp 646-652 (2021)
In recent years, several structure-based properties of the molecular graphs are understood through the chemical graph theory. The molecular graph GG of a molecule consists of vertices and edges, where vertices represent the atoms in a molecule and ed
Externí odkaz:
https://doaj.org/article/899aefa63de84f01b02acb0d14b2a63f
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph has the sa
Externí odkaz:
http://arxiv.org/abs/1402.2041
Autor:
Kanwal Salma, Imtiaz Mariam, Idrees Nazeran, Iftikhar Zurdat, Shaikh Tahira Sumbal, Arshad Misbah, Irfan Rida
Publikováno v:
Open Mathematics, Vol 18, Iss 1, Pp 1122-1134 (2020)
This study focuses on finding super edge-magic total (SEMT) labeling and deficiency of imbalanced fork and disjoint union of imbalanced fork with star, bistar and path; in addition, the SEMT strength for Imbalanced Fork is investigated.
Externí odkaz:
https://doaj.org/article/c5bbc879eb1a481ea7fe6a8ae0895f9f
Autor:
Kanwal Salma, Imtiaz Mariam, Iftikhar Zurdat, Ashraf Rehana, Arshad Misbah, Irfan Rida, Sumbal Tahira
Publikováno v:
Open Mathematics, Vol 17, Iss 1, Pp 527-543 (2019)
A graph ℘ is said to be edge-magic total (EMT if there is a bijection Υ : V(℘) ∪ E(℘) → {1, 2, …, |V(℘) ∪ E(℘)|} s.t., Υ(υ) + Υ(υν) + Υ(ν) is a constant for every edge υν ∈ E(℘). An EMT graph ℘ will be called strong
Externí odkaz:
https://doaj.org/article/af5b98fac4d349638dd75b658fd860f9
Autor:
Ye Ansheng, Qureshi Muhammad Imran, Fahad Asfand, Aslam Adnan, Jamil Muhammad Kamran, Zafar Asim, Irfan Rida
Publikováno v:
Open Chemistry, Vol 17, Iss 1, Pp 75-80 (2019)
Topological indices are the fixed numbers associated with the graphs. In recent years, mathematicians used indices to check the pharmacology characteristics and molecular behavior of medicines. In this article the first Zagreb connection number index
Externí odkaz:
https://doaj.org/article/db60191f90cb4eedb104bdbfae87525a
Publikováno v:
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, Vol 24, Iss 2, Pp 149-158 (2016)
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph has the sa
Externí odkaz:
https://doaj.org/article/b41d2b164a3045acad2d0151b451a4d2