Anti-Ramsey number was introduced by Erd(o)s et al.in 1973.The anti-Ramsey number AR(Kn, H) for the graph H in Kn is defined to be the maximum number of colors
Let G be a graph with adjacency matrix A and diagonal degree matrix D.The eigenvalues of G are the eigenvalues of A.Let εA(λ) ={x ∈ Rn | Ax =λx} be the eige
Graham, Lovász, et al.proved a very attractive theorem about the determinant of the distance matrix D(G) of a strongly connected directed graph G as a function