مرور Volume 15, Issue 3 بر اساس عنوان
در حال نمایش موارد 1 - 6 از 6
-
Compared Two Models for Shifted the Gap Energy in Acenes; Quantum Perturbation Theory and Topological Indices
(University of Kashan, 2024-09-01)Acenes, which can be represented by the chemical formula $C_{4n+2} H_{2n+4}$, belong to a group of organic molecules that have attracted significant attention in the fields of electronic molecules and nanoscale ...
-
Construction of Zero-Divisor Graph of a Hyperlattice with Respect to Hyperideals
(University of Kashan, 2024-09-01)In this paper, we define the zero-divisor graph of a meet-hyperlattice with respect to a hyperideal. We prove the diameter of a $P-$hyperlattice and Nakano hyperlattice are at most 3 and 4 respectively. We obtain ...
-
The Matrix Transformation Technique for the Time- Space Fractional Linear Schrödinger Equation
(University of Kashan, 2024-09-01)This paper deals with a time-space fractional Schrödinger equation with homogeneous Dirichlet boundary conditions. A common strategy for discretizing time-fractional operators is finite difference schemes. In these ...
-
Neighborhood M-Polynomial of Graph Operations: Exploring Nanostructure Applications and Correcting Cycle-Related Graph Results
(University of Kashan, 2024-09-01)Mathematical chemistry is a field of mathematics where chemical compounds are studied by associating a graph to it. A topological index serves as a mathematical invariant that elucidates the underlying topological ...
-
On the Multiplicative Reformulated First Zagreb Index of n-Vertex Trees with Respect to Matching Number
(University of Kashan, 2024-09-01)The multiplicative first Zagreb index is the product of the square of the degree of vertices in a graph $\mathbb{G}$. The multiplicative reformulated first Zagreb index is defined as $\prod_{1,e}(\mathbb{G})= ...
-
Steiner k-Eccentric Connectivity Index: a Novel Steiner Distance-Based Index
(University of Kashan, 2024-09-01)Let G be a connected graph and S be a k element subset of the vertex set V(G). The Steiner-k distance d_{G}(S) between vertices of S is the minimum size among all connected subgraphs whose vertex set contains S. In ...
