Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

Abstract: We investigate graph convolution networks with efficient learning from higher-order graph convolutions and direct learning from adjacency matrices for node classification. We revisit the ...

We derive a formula for the chromatic polynomial of a chordal or a triangulated graph in terms of its maximal cliques. As a corollary we obtain a way to write down an explicit formula for the ...

Abstract: Chebyshev interpolation polynomials exhibit the exponential approximation property to analytic functions on a cube. Based on the Chebyshev interpolation polynomial approximation, we propose ...

Abstract. Let 𝐼(𝐺;𝑥) denote the independence polynomial of a graph 𝐺. In this paper we study the unimodality properties of 𝐼(𝐺;𝑥) for some composite graphs 𝐺. Given two graphs 𝐺₁ and 𝐺₂, let ...