159 hasil
Menampilkan 1–20 · 0,18 detik · RSS
Scientific Annals of Computer Science
Scopus
ISSN 1843-8121 · Alexandru Ioan Cuza University of Iasi · 159 artikel di indeks
-
Artikel Jurnal
On the Formalization of the Notion of a Concurrent Algorithm
Previous papers give accounts of quests for satisfactory formalizations of the classical informal notion of an algorithm and the contemporary informal notion of an interactive algoritm. In this paper, an attempt is made to generalize the results of the former quest to the contemporary informal…
-
Artikel Jurnal
Degree and Neighborhood Degree Sum-based Topological Characteristics of Zosurabalpin: a Novel Drug for Managing Antibiotic-resistant Infection
This article is concerned with the topological characterization of the antibiotic Zosurabalpin through the computation of degree and associated neighborhood degree sum-based topological indices. The computation of the topological indices is carried out using the mathematical definition as well as…
-
Artikel Jurnal
On The ES Spectrum and ES Energy of Graph
In 2024, Gutman et al. [19] introduced the molecular descriptor called the Euler–Sombor (ES) index to analyze the graphical structure of a molecule. We define the corresponding Euler–Sombor matrix MES for a graph Γ as follows: The entry at position (i,j)-th is given by \sqrt{ρ_i^2+ρ_j^2+ρ_iρ_j} if…
-
Artikel Jurnal
M-polynomial Based Topological Analysis and Comparative Study of SiC3 Networks
Topological indices are numerical descriptors used in chemical graph theory to characterize the size, branching and connectivity of molecular structures. These descriptors are significantly correlated with a range of physicochemical characteristics and biological activities of a molecular compound…
-
Artikel Jurnal
The ‘Ancestor’ of Mundici’s Equivalence
This article provides an exposition of the main results presented in our book “Four Functors: the ‘ancestor’ of Mundici’s equivalence between unital commutative l-groups and MV algebras” appeared in autumn of 2025. Daniele Mundici has proved, in 1986, that the category of unital commutative…
-
Artikel Jurnal
Path Energy Bounds For Hub-Centric Graphs Of Order 2n+1 With Algorithmic Computation
This study investigates the path energy bounds of hub-centric graph families of order (2n+1), denoted by ℋ_{2n+1}. The path energy is defined as the absolute sum of the eigenvalues of the path adjacency matrix A_p(ℋ_{2n+1}), where each entry p_{ij} measures the maximum number of internally vertex-…
-
Artikel Jurnal
Second Hyper Zagreb Spectral Radii of Graph Operations
Chemical graph theory is essential for deriving graph spectral radius, especially in quantum chemistry; a significant link exists between eigenvalues and this invariant of spectral graph theory. This invariant is derived from spectrum, and has numerous applications in various fields and is used to…
-
Artikel Jurnal
Conditional Logic as a Short-Circuit Logic
Three-valued conditional logic (CL), defined by Guzmán and Squier (1990) and based on McCarthy’s noncommutative connectives, axiomatises a short-circuit logic (SCL), that is, a logic that prescribes short- circuit evaluation of conjunction and disjunction. CL defines more identities than…
-
Artikel Jurnal
On Sharp Bounds of Fault-Tolerant Partition Dimension of Convex Polytopes
Graph theory is a fundamental and powerful tool for designing and modeling networks. It plays a vital role in diverse real-world systems, including social, computer, biological, ecological, and neural networks. Convex polytopes are convex sets of elements contained in the Euclidean space ℝ^n. They…
-
Artikel Jurnal
Formalizing the Notions of Non-Interactive and Interactive Algorithms
An earlier paper gives an account of a quest for a satisfactory formalization of the classical informal notion of an algorithm. That notion only covers algorithms that are deterministic and non-interactive. In this paper, an attempt is made to generalize the results of that quest first to a notion…
-
Artikel Jurnal
On the Distribution of Vertex Energy of Connected Non-Regular Non-Bipartite Integral Graphs with Maximum Vertex Degree Four
The energy of a vertex in a graph plays a very important role in terms of its contribution to the total energy of a graph, a significant graph invariant in the field of chemical graph theory. Particularly, the computation of vertex energies of various types of graphs in general and integral graphs…
-
Artikel Jurnal
The Metric Dimension of Algebraic Constructed Graph of Dihedral Group Dn
In this article, we discusses the concept of metric dimension in graph theory and its applications in various scientific fields. Metric dimension is the minimum number of vertices in a graph that can uniquely identify all other vertices based on their distances to the vertices in the set. It has…
-
Artikel Jurnal
Degree-Based and Neighborhood Degree Sum-Based Entropy Measures of Molnupiravir
An entirely novel virus that causes severe acute respiratory syndrome began to spread around the world at the end of 2019. Since there are no curative treatments to treat the viral infection, efforts are being made globally to stop the coronavirus from spreading. The coronavirus strain is also…
-
Artikel Jurnal
Precautionary Logic and Ignorance Interval Transfer Mediated Inference
A relatively formal framework for the description of application of the precautionary principle is described, which we consider to provide a basic setup for precautionary logic, that is reasoning patterns making use of said precautionary principle. Probability is understood as subjective…
-
Artikel Jurnal
First Hyper Zagreb Spectral Radii of Splitting and Shadow Graphs
The spectral radius RS of graph G is a spectral invariant derived from the eigenvalues of the associated matrix for a graph G. It is widely used in fields such as computer science, chemistry, biology, and network analysis. A notable expansion of this notion is the First Hyper Zagreb spectral…
-
Artikel Jurnal
Degree-based Topological Characterization and Graph Energy Prediction of Silicon Carbide Network Si2C3-I[k, l] via Double Graph Operator
This study presents the precise formulation of the Nirmala index and the first and second inverse Nirmala indices for the double graph of the silicon carbide network Si2C3-I[k, l], using its M-polynomial. Entropy measures based on these indices are derived using Shannon’s entropy model. Numerical…
-
Artikel Jurnal
Modified Sombor Spectral Radii and Modified Sombor Energies of Splitting and Shadow Graphs
Gutman et al. introduced Sombor and Modified Somber index because of the rapidly growing applications in chemistry and network analysis. Graph energy ε(G) and the spectral radius ℘(G) of graph G are essential components that are associated with the eigenvalues of the matrix of graph G and…
-
Artikel Jurnal
z-ideals in the Semiring ℛ^+(L_τ)
Let ℛ^+(L_τ) denote the nonnegative τ-real-continuous function on a topoframe L_τ. We introduce the notion of z-ideals and maximal ideals in the semiring ℛ^+(L_τ) and state some results about them. Also, we show that the topoframe L_τ is a P-topoframe if and only if the semiring ℛ^+(L_τ) is a…
-
Artikel Jurnal
Monotonic Entropies
We introduce an axiomatization of entropy that generates, as special cases, novel entropy types. These entropies generalize Shannon’s entropy and allow the introduction of entropy for partitions of sets of objects located in metric spaces, and for partitions of sets of vertices in undirected…
-
Artikel Jurnal
Deriving M-polynomial Based Topological Descriptors of Oral Antiviral Clinical Drug Nirmatrelvir
The novel human coronavirus known as SARS-CoV-2 poses a serious risk to human health. Regretfully, the US Food and Drug Administration (FDA) has approved very few oral antiviral medications for the treatment of COVID-19 patients. In the current study, we have explored the topological…