The hereditary closure of the unigraphs

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2025-02-19 DOI:10.1016/j.disc.2025.114444

Michael D. Barrus , Ann N. Trenk , Rebecca Whitman

引用次数: 0

Abstract

A graph with degree sequence π is a unigraph if it is isomorphic to every graph that has degree sequence π. The class of unigraphs is not hereditary and in this paper we study the related hereditary class HCU, the hereditary closure of unigraphs, consisting of all graphs induced in a unigraph. We characterize the class HCU in multiple ways making use of the tools of a decomposition due to Tyshkevich. We also provide a new characterization of the class that consists of unigraphs for which all induced subgraphs are also unigraphs.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.