Graph, Matching Polynomial, Matching Uniqueness 1. Introduction All graphs considered in the paper are simple and undirected. The terminology not defined here can be found in [1] . Let G be a graph ...

Two graphs that are isomorphic. Back in 1979, two scientists wrote a seminal textbook on computational complexity theory, describing how some problems are hard to solve. The known algorithms for ...

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

Two nonisomorphic graphs G and H are said to be matching equivalent if and only if G and H have the same matching polynomials. In this paper, some families matching equivalent graphs are constructed.

A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial bounds on both memory ...

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

Mehdi Eliasi, Bijan Taeri, SCHULTZ POLYNOMIALS OF COMPOSITE GRAPHS, Applicable Analysis and Discrete Mathematics, Vol. 2, No. 2 (October 2008), pp. 285-296 ...