DOIAbstract
Let A(Pn) be the adjacency matrix of the path on n vertices. Suppose that r(?) is a polynomial of degree less than n, and consider the matrix M = r(A\u3e/(Pn)). We determine all polynomials for which M is the adjacency matrix of a graph
Let A(Pn) be the adjacency matrix of the path on n vertices. Suppose that r(?) is a polynomial of degree less than n, and consider the matrix M = r(A\u3e/(Pn)). We determine all polynomials for which M is the adjacency matrix of a graph
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Let A(Pn) be the adjacency matrix of the path on n vertices. Suppose that r(?) is a polynomial of de...
Let A(Pn) be the adjacency matrix of the path on n vertices. Suppose that r(?) is a polynomial of de...
AbstractLet A(Pn) be the adjacency matrix of the path on n vertices. Suppose that r(λ) is a polynomi...
AbstractLet G be a simple graph with adjacency matrix A, and p(x) a polynomial with rational coeffic...
We describe a simple, O(n 2 log(n)) algorithm to find the characteristic polynomial of the adjacen...
For any positive integer k let P<SUB>k</SUB> denote the characteristic polynomial of the adjacency m...
AbstractThe polynomial we consider here is the characteristic polynomial of a certain (not adjacency...
AbstractFor any positive integer k let Pk denote the characteristic polynomial of the adjacency matr...
112 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.Given graphs (GAMMA) and (DEL...
AbstractFor a graph G, we denote by h(G,x) the adjoint polynomial of G. Let β(G) denote the minimum ...
112 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.Given graphs (GAMMA) and (DEL...
In this paper we prove that a vertex-centered automorphism of a tree gives a proper factor of the ch...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Let A(Pn) be the adjacency matrix of the path on n vertices. Suppose that r(?) is a polynomial of de...
Let A(Pn) be the adjacency matrix of the path on n vertices. Suppose that r(?) is a polynomial of de...
AbstractLet A(Pn) be the adjacency matrix of the path on n vertices. Suppose that r(λ) is a polynomi...
AbstractLet G be a simple graph with adjacency matrix A, and p(x) a polynomial with rational coeffic...
We describe a simple, O(n 2 log(n)) algorithm to find the characteristic polynomial of the adjacen...
For any positive integer k let P<SUB>k</SUB> denote the characteristic polynomial of the adjacency m...
AbstractThe polynomial we consider here is the characteristic polynomial of a certain (not adjacency...
AbstractFor any positive integer k let Pk denote the characteristic polynomial of the adjacency matr...
112 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.Given graphs (GAMMA) and (DEL...
AbstractFor a graph G, we denote by h(G,x) the adjoint polynomial of G. Let β(G) denote the minimum ...
112 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.Given graphs (GAMMA) and (DEL...
In this paper we prove that a vertex-centered automorphism of a tree gives a proper factor of the ch...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Given a graph and a polynomial, a matrix can be constructed by evaluating the polynomial with the ad...
Add to ORKG