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

ABSTRACT: The matching energy of graph G is defined as , where be the roots of matching polynomial of graph G. In order to compare the energies of a pair of graphs, Gutman and Wager further put ...

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

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

D. CVETKOVIĆ, M. LEPOVIĆ, SEEKING COUNTEREXAMPLES TO THE RECONSTRUCTION CONJECTURE FOR THE CHARACTERISTIC POLYNOMIAL OF GRAPHS AND A POSITIVE RESULT, Bulletin (Académie serbe des sciences et des arts.

Quasi-best match graphs (qBMGs) are a hereditary class of directed, properly vertex -colored graphs. They arise naturally in mathematical phylogenetics as a generalization of best match graphs, which ...

Bao-Xuan Zhu ᵃ, Qinglin Lu ᵃ, Unimodality of the Independence Polynomials of Some Composite Graphs, Filomat, Vol. 31, No. 3 (2017), pp. 629-637 ...

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