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 ...

Abstract: Molecular graph generation is a critical task in computational chemistry with broad applications in drug discovery and material design. Existing generative approaches, such as variational ...

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 ...

Taiwanese Journal of Mathematics, Vol. 26, No. 5 (October 2022), pp. 1045-1068 (24 pages) We consider how distribution of eigenvalues depends on boundary conditions of a discrete Laplacian operator on ...

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 ...