2026-09-19T22:53:11Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/71218 2023-07-11 col_2142_5131 col_2142_16340 com_2142_5130 com_2142_16339 com_2142_8903

Beezer, Robert Arnold 2014-12-16T06:18:09Z 2014-12-16T06:18:09Z 10000-01-01 1984 1984 Given graphs (GAMMA) and (DELTA), and a real polynomial r(x), we will say that (DELTA) is generated from (GAMMA) by r(x) if r(A((GAMMA))) = A((DELTA)) where A((GAMMA)) and A((DELTA)) are adjacency matrices. For several interesting classes of graphs it is possible to determine all of the graphs which can be generated by a polynomial. Define the ith distance graph, (GAMMA)(,i), as the graph with the same vertex set as (GAMMA) and two vertices are adjacent in (GAMMA)(,i) if and only if they are a distance i apart. If (GAMMA) is a distance-regular graph, then for each i there exists a polynomial of degree i, p(,i)(x), such that p(,i)(A((GAMMA))) = A((GAMMA)(,i)). In fact, it has been shown that this property characterizes distance-regular graphs. With the above situation in mind, we construct the definition of an orbit polynomial graph. A graph is orbit polynomial if certain natural 0-1 matrices (determined by the automorphism group of the graph) are equal to polynomials of the adjacency matrix of the graph. We obtain many results about the properties of these graphs and their connections with association schemes. We also characterize orbit polynomial graphs with a prime number of vertices and the non-symmetric trivalent orbit polynomial graphs. We then study the graphs generated from a tree by a polynomial. For a path, all of the possible graphs are determined. A sunset is a path of even length with additional vertices adjacent to the central vertex. We produce a polynomial q(x) which generates a graph from a sunset which happens to be isomorphic to the original sunset. Motivated by this example, we study the situation where r(A((GAMMA))) = A((DELTA)), r(x) (NOT=) x, and (GAMMA) is isomorphic to (DELTA). Made available in DSpace on 2014-12-16T06:18:09Z (GMT). No. of bitstreams: 1 8422017.pdf: 2733092 bytes, checksum: cf35accee1f57e2961063fda816bc68d (MD5) Previous issue date: 1984 Embargo set by: Seth Robbins for item 71384 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 112 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984. http://hdl.handle.net/2142/71218 (UMI)AAI8422017 Mathematics Polynomials of the Adjacency Matrix of a Graph (distance-Transitive, Distance-Regular, Orbit) text University of Illinois at Urbana-Champaign Dissertation Ph.D. Mathematics Mathematics