Volume 15, Issue 2
مرور بر اساس
ارسال های اخیر
-
Maximum Modified Sombor Index of Unicyclic Graphs with Given Girth
(University of Kashan, 2024-06-01)For any graph $G$, the modified Sombor index is defined as the reciprocal of the well-known Sombor Index. The girth of $G$, by short $g(G)$, is the length of the smallest cycle in $G$. A graph with exactly one ...
-
Computation of Topological Indices of Binary and Ternary Trees using Algorithmic Approach
(University of Kashan, 2024-06-01)In this paper, algorithms are used to compute distance-based topological indices for the Complete Binary Tree (CBT) and the Complete Ternary Tree (CTT). Computation of distance-based topological indices is complex for ...
-
Retrieving the Transient Temperature Field and Blood Perfusion Coefficient in the Pennes Bioheat Equation Subject to Nonlocal and Convective Boundary Conditions
(University of Kashan, 2024-06-01)In this paper, we delve into a coefficient inverse problem linked to the bioheat equation, a pivotal component in medical research concerning phenomena such as temperature response and blood perfusion during surface ...
-
Computation of Some Graph Energies of the Zero-Divisor Graph Associated~ with the Commutative Ring $\mathbb{Z}_{p^{2}}[x]/\langle x^{2} \rangle$
(University of Kashan, 2024-06-01)Let $\mathcal{R}$ be the commutative ring $\mathcal{R}=\mathbb{Z}_{p^2}[x]/\langle x^{2} \rangle$ with identity and ${Z^{*}}(\mathcal{R})$ be the set of all non-zero zero-divisors of $\mathcal{R}$. Then, $\Gamma(\mathcal{R})$ ...
-
The Laplacian Spectrum of the Generalized $n$-Prism Networks
(University of Kashan, 2024-06-01)The Laplacian eigenvalues and polynomials of the networks play an essential role in understanding the relations between the topology and the dynamic of networks. Generally, computation of the Laplacian spectrum of a ...
-
Investigation of the Partition Dimension in Chemical Networks and its Application in Chemistry
(University of Kashan, 2024-06-01)Partition dimension problems involve dividing a graph's vertex set into a minimum number of disjoint sets so that each vertex is different with respect to the representation from each disjoint set. As a result of the ...
