Summary. 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 some trinomials over finite fields have the same number of roots
AbstractWe refine the polychromate defined by Brylawski (J. Combin. Theory Ser. B 30 (1981) 233–246)...
Sibling curves were demonstrated in papers [2, 3] as a novel way to visualize the zeros of complex v...
We deal with a possible improvement of a certain polynomial algorithm for the graph isomorphism prob...
Summary. We present an example of a result in graph theory that is used to obtain a result in anothe...
AbstractA study is made of asymptotic arithmetical properties of the isomorphism classes of certain ...
Graph polynomials are uniformly defined families of graph invariants which are polynomials in some p...
Given a function f in a finite field Fq of q elements, we define the functional graph of f as a dire...
Godsil observed the simple fact that the multiplicity of 0 as a root of the matching polynomial of a...
A most efficient way of investigating combinatorially defined point sets in spaces over finite field...
summary:We introduce a new concept namely the degree polynomial for the vertices of a simple graph. ...
Graph polynomials are polynomials associated to graphs that encode the number of subgraphs with give...
Abstract. Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial...
This dissertation deals with some basic proper ties of finite graphs having no loops and no parallel...
AbstractThe present paper is addressed to the problem of determining under what conditions the chara...
We refine the polychromate defined by Brylawski (J. Combin. Theory Ser. B 30 (1981) 233-246) to a gr...
AbstractWe refine the polychromate defined by Brylawski (J. Combin. Theory Ser. B 30 (1981) 233–246)...
Sibling curves were demonstrated in papers [2, 3] as a novel way to visualize the zeros of complex v...
We deal with a possible improvement of a certain polynomial algorithm for the graph isomorphism prob...
Summary. We present an example of a result in graph theory that is used to obtain a result in anothe...
AbstractA study is made of asymptotic arithmetical properties of the isomorphism classes of certain ...
Graph polynomials are uniformly defined families of graph invariants which are polynomials in some p...
Given a function f in a finite field Fq of q elements, we define the functional graph of f as a dire...
Godsil observed the simple fact that the multiplicity of 0 as a root of the matching polynomial of a...
A most efficient way of investigating combinatorially defined point sets in spaces over finite field...
summary:We introduce a new concept namely the degree polynomial for the vertices of a simple graph. ...
Graph polynomials are polynomials associated to graphs that encode the number of subgraphs with give...
Abstract. Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial...
This dissertation deals with some basic proper ties of finite graphs having no loops and no parallel...
AbstractThe present paper is addressed to the problem of determining under what conditions the chara...
We refine the polychromate defined by Brylawski (J. Combin. Theory Ser. B 30 (1981) 233-246) to a gr...
AbstractWe refine the polychromate defined by Brylawski (J. Combin. Theory Ser. B 30 (1981) 233–246)...
Sibling curves were demonstrated in papers [2, 3] as a novel way to visualize the zeros of complex v...
We deal with a possible improvement of a certain polynomial algorithm for the graph isomorphism prob...
DOI
Add to ORKG