Recent work by Marcus, Spielman and Srivastava proves the existence of bipartite Ramanujan (multi) graphs of all degrees and all sizes. However, that paper did not provide a polynomial time algorithm ...

We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown that on the class of ...

PolyGCL: GRAPH CONTRASTIVE LEARNING via Learnable Spectral Polynomial Filters This repository contains a PyTorch implementation of ICLR 2024 paper " PolyGCL: GRAPH CONTRASTIVE LEARNING via Learnable ...

Moreover, we propose a close relationship between independence polynomial of corona graph and h h -polynomial of its independence simplicial complexes. Thereby, the formula of h h -polynomial is ...

Welcome to the official code repository for SLOG: An Inductive Spectral Graph Neural Network Beyond Polynomial Filter, accepted at ICML 2024.

This section focuses on the key features and methods for working with linear graphs. It demonstrates how to sketch graphs from rules, derive rules from graphs, and calculate key features such as the ...

Functions are one of the most fundamental concepts in mathematics, serving as a cornerstone for topics in algebra, calculus and beyond. Basics of functions are stepping-stone to success in functions ...