EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


10335 Tutte sets in graphs I: Maximal tutte sets and D-graphs
Home Policy Brochure Browse Search User Area Contact Help

Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (2007) Tutte sets in graphs I: Maximal tutte sets and D-graphs. Journal of Graph Theory, 55 (4). pp. 343-358. ISSN 0364-9024 *** ISI Impact 0,561 ***

Full text available as:

PDF
- Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
178 Kb

Official URL: http://dx.doi.org/10.1002/jgt.20243

Exported to Metis

Abstract

A well-known formula of Tutte and Berge expresses the size of a maximum matching in a graph $G$ in terms of what is usually called the deficiency of $G$. A subset $X$ of $V(G)$ for which this deficiency is attained is called a Tutte set of $G$. While much is known about maximum matchings, less is known about the structure of Tutte sets. In this article, we study the structural aspects of maximal Tutte sets in a graph $G$. Towards this end, we introduce a related graph $D(G)$. We first show that the maximal Tutte sets in $G$ are precisely the maximal independent sets in its $D$-graph $D(G)$, and then continue with the study of $D$-graphs in their own right, and of iterated $D$-graphs. We show that $G$ is isomorphic to a spanning subgraph of $D(G)$, and characterize the graphs for which $G\cong D(G)$ and for which $D(G)\cong D^2(G)$. Surprisingly, it turns out that for every graph $G$ with a perfect matching, $D^3(G)\cong D^2(G)$. Finally, we characterize bipartite $D$-graphs and comment on the problem of characterizing $D$-graphs in general.

Item Type:Article
Research Group:EWI-DMMP: Discrete Mathematics and Mathematical Programming
Research Program:CTIT-IE&ICT: Industrial Engineering and ICT
ID Code:10335
Status:Published
Deposited On:13 July 2007
Refereed:Yes
International:Yes
ISI Impact Factor:0,561
More Information:statisticsmetis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item