Degree sequences of highly irregular graphs

We 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...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics 1997-02, Vol.164 (1), p.225-236
Main Authors: Majcher, Zofia, Michael, Jerzy
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We 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.
ISSN:0012-365X
1872-681X
DOI:10.1016/S0012-365X(97)84782-6