AbstractLet 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>/(Pn)). We determine all polynomials for which M is the adjacency matrix of a graph
AbstractIf A is the adjacency matrix of a graph G, then Ai is the adjacency matrix of the graph on t...
In this paper we prove that a vertex-centered automorphism of a tree gives a proper factor of the ch...
AbstractIn their 1978 paper “Distance matrix polynomials of trees” Graham and Lovász proved that the...
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...
Let A(Pn) be the adjacency matrix of the path on n vertices. Suppose that r(?) is a polynomial of de...
AbstractGiven a graph and a polynomial, a matrix can be constructed by evaluating the polynomial wit...
112 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.Given graphs (GAMMA) and (DEL...
112 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.Given graphs (GAMMA) and (DEL...
AbstractLet G be a finite connected graph. If x and y are vertices of G, one may define a distance f...
AbstractThe author investigates the periodicity of path polynomials Pk(λ) evaluated at the adjacency...
AbstractThe characteristic polynomial of the adjacency matrix of the subdivision graph G is related ...
AbstractLet G be a simple graph with adjacency matrix A, and p(x) a polynomial with rational coeffic...
AbstractIn this paper we prove that a vertex-centered automorphism of a tree gives a proper factor o...
We describe a simple, O(n 2 log(n)) algorithm to find the characteristic polynomial of the adjacen...
AbstractIf A is the adjacency matrix of a graph G, then Ai is the adjacency matrix of the graph on t...
In this paper we prove that a vertex-centered automorphism of a tree gives a proper factor of the ch...
AbstractIn their 1978 paper “Distance matrix polynomials of trees” Graham and Lovász proved that the...
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...
Let A(Pn) be the adjacency matrix of the path on n vertices. Suppose that r(?) is a polynomial of de...
AbstractGiven a graph and a polynomial, a matrix can be constructed by evaluating the polynomial wit...
112 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.Given graphs (GAMMA) and (DEL...
112 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.Given graphs (GAMMA) and (DEL...
AbstractLet G be a finite connected graph. If x and y are vertices of G, one may define a distance f...
AbstractThe author investigates the periodicity of path polynomials Pk(λ) evaluated at the adjacency...
AbstractThe characteristic polynomial of the adjacency matrix of the subdivision graph G is related ...
AbstractLet G be a simple graph with adjacency matrix A, and p(x) a polynomial with rational coeffic...
AbstractIn this paper we prove that a vertex-centered automorphism of a tree gives a proper factor o...
We describe a simple, O(n 2 log(n)) algorithm to find the characteristic polynomial of the adjacen...
AbstractIf A is the adjacency matrix of a graph G, then Ai is the adjacency matrix of the graph on t...
In this paper we prove that a vertex-centered automorphism of a tree gives a proper factor of the ch...
AbstractIn their 1978 paper “Distance matrix polynomials of trees” Graham and Lovász proved that the...
DOI
Add to ORKG