This paper investigates the significance of employing random subgraphs and analyzing the expected values of Zagreb ndices within chemical graphs. By examining smaller, representative subsets, we uncover valuable insights into the properties and ...${}_{\mathrm{}}$${}_{\mathrm{}}$

This study investigates the prize-collecting single machine scheduling with bounds and penalties (PC-SMS-BP). In this problem, a set of n jobs and a single machine are considered, where each job $J_j$ has a processing time $p_j$, a profit ${\pi }_j$ and a ...${}_{}$$$

Predictive monitoring is a subfield of process mining that aims to predict how a running case will unfold in the future. One of its main challenges is forecasting the sequence of activities that will occur from a given point in time —suffix ...

We propose a novel stochastic algorithm that randomly samples entire rows and columns of the matrix as a way to approximate an arbitrary matrix function using the power series expansion. This contrasts with existing Monte Carlo methods, which only ...

Consider a graph G with vertex set V(G) and edge set E(G). A subset D of V(G) is said to be a dominating set of G if every vertex not in D is adjacent to at least one vertex in D. If, in addition, every vertex not in a dominating set R of G is ...$$${}_{}$$\mathrm{}\mathrm{}$$$$\mathrm{}$${}_{}$

Motivated by the PageRank model for graph partitioning, we develop an extension of PageRank for partitioning uniform hypergraphs. Starting from adjacency tensors of uniform hypergraphs, we establish the multi-linear pseudo-PageRank (MLPPR) model, ...

For a graph G = ( V , E ), the exponential second Zagreb index is defined as e M 2 ( G ) = ∑ u v ∈ E e d ( u ) d ( v ), where d ( v ) is the degree of vertex v ∈ V. Recently, Eliasi (2022) posed a conjecture about ( n , m )-graphs with maximum e ...

The two point effective resistance in some electrical networks has been extensively studied by many mathematicians and physicists. The computation of the effective resistance among two points in a network is a well-known problem in ...

Heterogeneous Information Networks (HINs) consist of multiple categories of nodes and edges and encompass rich semantic information. Representing HINs in a low-dimensional feature space is challenging due to its complex structure and rich ...

Recipe data and user interactions and preferences have been widely studied in food computing, especially for the recipe recommendation task. One part of these works seeks to introduce healthy patterns while considering user preferences, known as ...

Community detection is used to determine the network structure and node relationships. However, it raises privacy concerns when locating and disclosing the members’ personal or community information. Community deception is a method of hiding a ...

We introduce new geometric and combinatorial criteria that preclude a neural code from being convex, and use them to tackle the classification problem for codes on six neurons. Along the way, we give the first example of a code that is ...

Private Simultaneous Messages (PSM) model is a minimal model for secure multiparty computation. Feige, Kilian, and Naor (STOC 1994) and Ishai (Cryptology and Information Security Series 2013) constructed PSM protocols based on quadratic residues. ...${\mathrm{}\mathrm{}}^{}\mathrm{}\mathrm{}$${}^{\mathrm{}}$${}^{\mathrm{}}$${\mathbb{}}_{}$$\mathrm{}\mathrm{}{}^{\mathrm{}}{\mathrm{}}^{\mathrm{}\mathrm{}}$${\mathrm{}\sqrt{\mathrm{}}}^{\mathrm{}}$

In this work, we develop a new complexity metric for an important class of low-rank matrix optimization problems in both symmetric and asymmetric cases, where the metric aims to quantify the complexity of the nonconvex optimization landscape of ...

In a previous paper Todd (Submitted to AMAI, 2022), linear systems corresponding to sets of angle bisector conditions are analyzed. In a system which is not full rank, one bisector condition can be derived from the others. In that paper, we ...

• A new class of graphs which is k-optimal is presented.
• For planar graphs of ...

Let G be a connected graph with n vertices. Suppose a fire breaks out at some vertex of G. At each time interval, firefighters can protect up to k vertices, and then the fire spreads to all unprotected neighbors. Let dnk ( v ) denote ...

• The greatest Mostar index among the graphs with order n and diameter d is determined.

For an edge e = u v in a given graph G, let n G u ( e ) be the number of vertices which have a less distance from u than that from v. Then | n G u ( e ) − n G v ( e ) | is called the contribution of e. The Mostar index is defined as ...

The metric dimension of a graph is the smallest number of nodes required to identify all other nodes uniquely based on shortest path distances. Applications of metric dimension include discovering the source of a spread in a network, canonically labeling ...

Based on the extended adjacency matrix, the spectral radius and the energy of the extended adjacency matrix are found that they possess high discriminating power and correlate well with a number of physicochemical properties and biological ...

Today’s supercomputers contain thousands of processing cores. As the number of processing units grows, the probability of failing some processing units increases. Therefore, finding faulty units has become a concern in these systems which depends ...${}^{}$$$$$${}^{}$${}^{{}^{}}$$\mathrm{}$$\mathrm{}$$$${}_{\mathrm{}}^{{}^{}}$$\mathrm{}$${}_{}$${}_{\mathrm{}\mathrm{}}$$\left(\mathrm{}\right)$$\mathrm{}$$\mathrm{}\mathrm{}$