Various aspects of combinatorial information concerning a graph is stored in the coefficients of a specific graph polynomial, so represented also by the roots of such graph polynomial. It is natural ...

Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this ...

2. Graphs with the Maximum Matching Root Less than or Equal to 2 Let G be a graph with order n. Since the roots of are real numbers (see [7] ), the maximum root of denoted by, the characteristic ...

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

Step roots of Littlewood polynomials and the extrema of functions in the Takagi class Citation: Han, Xiyue , and Alexander Schied. “Step roots of Littlewood polynomials and the extrema of functions in ...

AUTHORS: Haicheng Ma, Yinkui Li KEYWORDS: Matching Polynomial, Matching-Equivalent, Matching Unique JOURNAL NAME: Applied Mathematics, Vol.7 No.9, May 27, 2016 ABSTRACT: In the paper, we give a ...

Graph Neural Networks (GNNs) exploit signals from node features and the input graph topology to improve node classification task performance. Recently proposed GNNs work across a variety of homophilic ...

Abstract: Various aspects of combinatorial information concerning a graph is stored in the coefficients of a specific graph polynomial, so represented also by the roots of such graph polynomial. It is ...