Well-indumatched Trees and Graphs of Bounded Girth

Well-indumatched Trees and Graphs of Bounded Girth

A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time algorithm to decide if a tree is well-indumatched or not. Then, we characterize minimal well-indumatched graphs of girth...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Akbari, S, Ekim, T, Ghodrati, A. H, Zare, S
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Discrete Mathematics
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Akbari, S
Ekim, T
Ghodrati, A. H
Zare, S
description A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time algorithm to decide if a tree is well-indumatched or not. Then, we characterize minimal well-indumatched graphs of girth at least 9 and show subsequently that for an odd integer g greater than or equal to 9 and different from 11, there is no well-indumatched graph of girth g. On the other hand, there are infinitely many well-indumatched unicyclic graphs of girth k, where k is in {3, 5, 7} or k is an even integer greater than 2. We also show that, although the recognition of well-indumatched graphs is known to be co-NP-complete in general, one can recognize in polynomial time well-indumatched graphs where the size of maximal induced matchings is fixed.
doi_str_mv 10.48550/arxiv.1903.03197
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1903_03197</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1903_03197</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-30e2af0b08a59d53722694e22f4352f5b7714226d08ada12a0620e7f4397c6e23</originalsourceid><addsrcrecordid>eNotjsGKwjAURbNxMagfMCvzA60vL01jliraGRBmU5hleZoXWqhVUhX9e6szqwv3XC5HiE8FabYwBuYU780tVQ50Clo5-yHwl9s2aTp_PdLlULOXZWTuJXVeFpHOdS9PQa5O184PrGjipZ6IUaC25-l_jkW53ZTrr2T3U3yvl7uEcmsTDYwUYA8LMs4bbRFzlzFiyLTBYPbWqmzo_DDwpJAgR2A7UGcPOaMei9nf7Vu6OsfmSPFRveSrt7x-AiPdPPQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Well-indumatched Trees and Graphs of Bounded Girth</title><source>arXiv.org</source><creator>Akbari, S ; Ekim, T ; Ghodrati, A. H ; Zare, S</creator><creatorcontrib>Akbari, S ; Ekim, T ; Ghodrati, A. H ; Zare, S</creatorcontrib><description>A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time algorithm to decide if a tree is well-indumatched or not. Then, we characterize minimal well-indumatched graphs of girth at least 9 and show subsequently that for an odd integer g greater than or equal to 9 and different from 11, there is no well-indumatched graph of girth g. On the other hand, there are infinitely many well-indumatched unicyclic graphs of girth k, where k is in {3, 5, 7} or k is an even integer greater than 2. We also show that, although the recognition of well-indumatched graphs is known to be co-NP-complete in general, one can recognize in polynomial time well-indumatched graphs where the size of maximal induced matchings is fixed.</description><identifier>DOI: 10.48550/arxiv.1903.03197</identifier><language>eng</language><subject>Computer Science - Discrete Mathematics ; Mathematics - Combinatorics</subject><creationdate>2019-03</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1903.03197$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1903.03197$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Akbari, S</creatorcontrib><creatorcontrib>Ekim, T</creatorcontrib><creatorcontrib>Ghodrati, A. H</creatorcontrib><creatorcontrib>Zare, S</creatorcontrib><title>Well-indumatched Trees and Graphs of Bounded Girth</title><description>A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time algorithm to decide if a tree is well-indumatched or not. Then, we characterize minimal well-indumatched graphs of girth at least 9 and show subsequently that for an odd integer g greater than or equal to 9 and different from 11, there is no well-indumatched graph of girth g. On the other hand, there are infinitely many well-indumatched unicyclic graphs of girth k, where k is in {3, 5, 7} or k is an even integer greater than 2. We also show that, although the recognition of well-indumatched graphs is known to be co-NP-complete in general, one can recognize in polynomial time well-indumatched graphs where the size of maximal induced matchings is fixed.</description><subject>Computer Science - Discrete Mathematics</subject><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjsGKwjAURbNxMagfMCvzA60vL01jliraGRBmU5hleZoXWqhVUhX9e6szqwv3XC5HiE8FabYwBuYU780tVQ50Clo5-yHwl9s2aTp_PdLlULOXZWTuJXVeFpHOdS9PQa5O184PrGjipZ6IUaC25-l_jkW53ZTrr2T3U3yvl7uEcmsTDYwUYA8LMs4bbRFzlzFiyLTBYPbWqmzo_DDwpJAgR2A7UGcPOaMei9nf7Vu6OsfmSPFRveSrt7x-AiPdPPQ</recordid><startdate>20190307</startdate><enddate>20190307</enddate><creator>Akbari, S</creator><creator>Ekim, T</creator><creator>Ghodrati, A. H</creator><creator>Zare, S</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20190307</creationdate><title>Well-indumatched Trees and Graphs of Bounded Girth</title><author>Akbari, S ; Ekim, T ; Ghodrati, A. H ; Zare, S</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-30e2af0b08a59d53722694e22f4352f5b7714226d08ada12a0620e7f4397c6e23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computer Science - Discrete Mathematics</topic><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Akbari, S</creatorcontrib><creatorcontrib>Ekim, T</creatorcontrib><creatorcontrib>Ghodrati, A. H</creatorcontrib><creatorcontrib>Zare, S</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Akbari, S</au><au>Ekim, T</au><au>Ghodrati, A. H</au><au>Zare, S</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Well-indumatched Trees and Graphs of Bounded Girth</atitle><date>2019-03-07</date><risdate>2019</risdate><abstract>A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time algorithm to decide if a tree is well-indumatched or not. Then, we characterize minimal well-indumatched graphs of girth at least 9 and show subsequently that for an odd integer g greater than or equal to 9 and different from 11, there is no well-indumatched graph of girth g. On the other hand, there are infinitely many well-indumatched unicyclic graphs of girth k, where k is in {3, 5, 7} or k is an even integer greater than 2. We also show that, although the recognition of well-indumatched graphs is known to be co-NP-complete in general, one can recognize in polynomial time well-indumatched graphs where the size of maximal induced matchings is fixed.</abstract><doi>10.48550/arxiv.1903.03197</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1903.03197
ispartof
issn
language eng
recordid cdi_arxiv_primary_1903_03197
source arXiv.org
subjects Computer Science - Discrete Mathematics
Mathematics - Combinatorics
title Well-indumatched Trees and Graphs of Bounded Girth
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T19%3A02%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Well-indumatched%20Trees%20and%20Graphs%20of%20Bounded%20Girth&rft.au=Akbari,%20S&rft.date=2019-03-07&rft_id=info:doi/10.48550/arxiv.1903.03197&rft_dat=%3Carxiv_GOX%3E1903_03197%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true