The Johnson graph J (n, k) is defined by n symbols, where vertices are k-element subsets of the symbols, and vertices are adjacent if they differ in exactly one symbol. In particular, both J (n, 1), ...

Discrete Morse theory is a versatile tool from combinatorial algebraic topology. In a nutshell, discrete Morse theory uses certain well-behaved functions, the so-called discrete Morse functions, from ...

Abstract: Integrating Large Language Models (LLMs) with Graph Neural Networks (GNNs) has emerged as a dominant paradigm for representation learning on Text-Attributed Graphs (TAGs). Existing ...

The main objective of work package 3 is to improve the understanding of the transition between discrete and continuum nonlocal models, which are investigated as part of the first two main objectives ...

Abstract: In this paper, we present a novel method for advancing time series forecasting by representing discretized time series data through de Bruijn Graphs (dBGs). This method harnesses the ...

ABSTRACT: Let G=( V,E ) be a graph. The first Zagreb index of a graph G is defined as ∑ u∈V d G 2 ( u ) , where d G ( u ) is the degree of vertex u in G . In this paper, we obtain two lower bounds ...

Characterization of dislocation motion in the alloy using discrete dislocation dynamics (DDD) simulations. Video showing the effect of lattice strain field on the dynamic evolution of dislocations ...