View article

Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these subclasses are well studied in the literature. Nevertheless, there are few results on superclasses of unigraphs. In this paper, we introduce two types of generalizations of unigraphs: -unigraphs and -strong unigraphs. We say that a graph is a -unigraph if can be partitioned into unigraphs. is a -strong unigraph if not only each subgraph is a unigraph but also the whole graph can be uniquely determined up to isomorphism, by using the degree sequences of all the subgraphs in the partition. We describe a relation between -strong unigraphs and the subgraph isomorphism problem. We show some properties of -(strong) unigraphs and algorithmic results on calculating the minimum such that a graph is a -(strong) unigraph. This paper will open many other research topics.