Let t be a positive integer and S a set of integers.If for any two elements a and b of S, |a-b| ≥ t, then S is said to be t-separated.For two sets I and J of i
The p-spectral radius of graphs unifies several graph parameters like the number of edges and the spectral radius of the adjaceny matrix.This talk presents solu
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