6533b850fe1ef96bd12a8389

RESEARCH PRODUCT

Degree sequences of highly irregular graphs

Zofia MajcherJerzy Michael

subject

Discrete mathematicsCombinatoricsSequenceLoop (graph theory)Simple graphDegree (graph theory)Frequency partition of a graphHighly irregular graphBiregular graphDiscrete Mathematics and CombinatoricsTheoretical Computer ScienceMathematicsMathematicsofComputing_DISCRETEMATHEMATICS

description

AbstractWe call a simple graph highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we examine the degree sequences of highly irregular graphs. We give necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a highly irregular graph.

10.1016/s0012-365x(97)84782-6http://dx.doi.org/10.1016/S0012-365X(97)84782-6