Abstract: Although graph structures have proved useful in high level vision for object recognition and matching, they can prove computationally cumbersome because of the need to establish reliable ...

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

This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book ...

Department of Mathematics and Statistics, Qinghai Minzu University, Xining, China. Since then, much attention has been paid to this topic, but they mainly focus on undirected graphs and integral trees ...

The Hosoya polynomial H(G, λ) of a graph G has the property that its first derivative at λ = 1 is equal to the Wiener index. Sometime ago two distance-based graph invariants were studied - the Schultz ...

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

General graph neural networks (GNNs) implement convolution operations on graphs based on polynomial spectral filters. Existing filters with high-order polynomial approximations can detect more ...

We present an example of a result in graph theory that is used to obtain a result in another branch of mathematics. More precisely, we show that the isomorphism of certain directed graphs implies that ...

Phylogenetic trees are a central tool in many areas of life science and medicine. They demonstrate evolutionary patterns among species, genes, and patterns of ancestry among sets of individuals. The ...

Anyone who’s taken classes in geometry, algebra, trigonometry or other advanced math forms has certainly encountered the graphing calculator before. These multi-function devices make incredibly ...