We give some inequalities relating the number of edges that two graphs of same order may have in common with their degree sequences and their spectra. We then give some examples and related inequalities, and present applications to independence number and coloration.