Wyoming Space Grant Consortium
WyoScholar Institutional Repository (University of Wyoming)Not a member yet
6751 research outputs found
Sort by
Proposed Statement of Principles for the Wyoming Bar Association and Wyoming Press Association
Two linear preserver problems on graphs
Let n, t, k be integers such that 3 ≤ t,k ≤ n. Denote by G_n the set of graphs with vertex set {1,2,...,n}. In this paper, the complete linear transformations on G_n mapping K_t-free graphs to K_t-free graphs are characterized. The complete linear transformations on G_n mapping C_k-free graphs to C_k-free graphs are also characterized when n ≥ 6
On the Second Least Distance Eigenvalue of a Graph
Let be a connected graph on vertices, and let be the distance matrix of . Let denote the eigenvalues of . In this paper, the connected graphs with @n1(G) at least the smallest root of are determined. Additionally, some non-isomorphic distance cospectral graphs are given