Highly Irregular Graphs

A connected graph is highly irregular if each of its vertices is adjacent to vertices with distinct degrees. In this paper we investigate several problems concerning the existence and enumeration of highly irregular graphs as well as their independence numbers, with particular focus on the corresponding problems for highly irregular trees.