Determinantal decomposition of graphs with a unique perfect matching

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2024-12-27 DOI:10.1016/j.disc.2024.114370

Daniel A. Jaume , Diego G. Martinez , Cristian Panelo

引用次数: 0

Abstract

In this work, a structural decomposition of graphs with a unique perfect matching is introduced. The decomposition is given by the barbell subgraphs: even subdivisions of two

K_{3}

graphs joined by an edge such that the unique perfect matching of G induces a perfect matching in the subgraphs. The decomposition breaks a graph G, with a unique perfect matching, into two subgraphs, one of which is a Kőnig-Egerváry graph. Furthermore, the decomposition is shown to be multiplicative with respect to determinantal-type (Schur) functions of the adjacency matrix of graphs with a unique perfect matching. Additionally, in this work, Godsil's formula for the determinant of trees with perfect matching is extended to all graphs with a unique perfect matching.

查看原文本刊更多论文

求助全文

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