Lower bounds for the Randić index in terms of matching number

Lower bounds for the Randić index in terms of matching number

We investigate how small the Randić index of a graph can be in terms of its matching number, and prove several results. We give best-possible linear bounds for graphs of small excess and for subcubic graphs; in the former case the size of excess we permit is qualitatively the best possible. We show...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2024-08
Hauptverfasser: Akbari, Saieed, Sina Ghasemi Nezhad, Ghazizadeh, Reyhane, Haslegrave, John, Tohidi, Elahe
Format: Artikel
Sprache:eng
Schlagworte:
Graphs
Lower bounds
Matching
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Akbari, Saieed
Sina Ghasemi Nezhad
Ghazizadeh, Reyhane
Haslegrave, John
Tohidi, Elahe
description We investigate how small the Randić index of a graph can be in terms of its matching number, and prove several results. We give best-possible linear bounds for graphs of small excess and for subcubic graphs; in the former case the size of excess we permit is qualitatively the best possible. We show that a linear bound holds for any sparse hereditary graph class (such as planar graphs). In general, however, we show that it can be much smaller than linear. We determine the asymptotic growth rate of the minimum Randić index for graphs with a near perfect matching, and conjecture that the same bounds hold for all graphs.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2929277694</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2929277694</sourcerecordid><originalsourceid>FETCH-proquest_journals_29292776943</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSw88kvTy1SSMovzUspVkjLL1IoyUhVCErMS8k80q6QmZeSWgEkFUpSi3KLFfLTFHITS5IzMvPSFfJKc5NSi3gYWNMSc4pTeaE0N4Oym2uIs4duQVF-YWlqcUl8Vn5pUR5QKt7IEgjNzc0sTYyJUwUAylQ4jQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2929277694</pqid></control><display><type>article</type><title>Lower bounds for the Randić index in terms of matching number</title><source>Freely Accessible Journals</source><creator>Akbari, Saieed ; Sina Ghasemi Nezhad ; Ghazizadeh, Reyhane ; Haslegrave, John ; Tohidi, Elahe</creator><creatorcontrib>Akbari, Saieed ; Sina Ghasemi Nezhad ; Ghazizadeh, Reyhane ; Haslegrave, John ; Tohidi, Elahe</creatorcontrib><description>We investigate how small the Randić index of a graph can be in terms of its matching number, and prove several results. We give best-possible linear bounds for graphs of small excess and for subcubic graphs; in the former case the size of excess we permit is qualitatively the best possible. We show that a linear bound holds for any sparse hereditary graph class (such as planar graphs). In general, however, we show that it can be much smaller than linear. We determine the asymptotic growth rate of the minimum Randić index for graphs with a near perfect matching, and conjecture that the same bounds hold for all graphs.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Graphs ; Lower bounds ; Matching</subject><ispartof>arXiv.org, 2024-08</ispartof><rights>2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</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>776,780</link.rule.ids></links><search><creatorcontrib>Akbari, Saieed</creatorcontrib><creatorcontrib>Sina Ghasemi Nezhad</creatorcontrib><creatorcontrib>Ghazizadeh, Reyhane</creatorcontrib><creatorcontrib>Haslegrave, John</creatorcontrib><creatorcontrib>Tohidi, Elahe</creatorcontrib><title>Lower bounds for the Randić index in terms of matching number</title><title>arXiv.org</title><description>We investigate how small the Randić index of a graph can be in terms of its matching number, and prove several results. We give best-possible linear bounds for graphs of small excess and for subcubic graphs; in the former case the size of excess we permit is qualitatively the best possible. We show that a linear bound holds for any sparse hereditary graph class (such as planar graphs). In general, however, we show that it can be much smaller than linear. We determine the asymptotic growth rate of the minimum Randić index for graphs with a near perfect matching, and conjecture that the same bounds hold for all graphs.</description><subject>Graphs</subject><subject>Lower bounds</subject><subject>Matching</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSw88kvTy1SSMovzUspVkjLL1IoyUhVCErMS8k80q6QmZeSWgEkFUpSi3KLFfLTFHITS5IzMvPSFfJKc5NSi3gYWNMSc4pTeaE0N4Oym2uIs4duQVF-YWlqcUl8Vn5pUR5QKt7IEgjNzc0sTYyJUwUAylQ4jQ</recordid><startdate>20240820</startdate><enddate>20240820</enddate><creator>Akbari, Saieed</creator><creator>Sina Ghasemi Nezhad</creator><creator>Ghazizadeh, Reyhane</creator><creator>Haslegrave, John</creator><creator>Tohidi, Elahe</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20240820</creationdate><title>Lower bounds for the Randić index in terms of matching number</title><author>Akbari, Saieed ; Sina Ghasemi Nezhad ; Ghazizadeh, Reyhane ; Haslegrave, John ; Tohidi, Elahe</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_29292776943</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Graphs</topic><topic>Lower bounds</topic><topic>Matching</topic><toplevel>online_resources</toplevel><creatorcontrib>Akbari, Saieed</creatorcontrib><creatorcontrib>Sina Ghasemi Nezhad</creatorcontrib><creatorcontrib>Ghazizadeh, Reyhane</creatorcontrib><creatorcontrib>Haslegrave, John</creatorcontrib><creatorcontrib>Tohidi, Elahe</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Akbari, Saieed</au><au>Sina Ghasemi Nezhad</au><au>Ghazizadeh, Reyhane</au><au>Haslegrave, John</au><au>Tohidi, Elahe</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Lower bounds for the Randić index in terms of matching number</atitle><jtitle>arXiv.org</jtitle><date>2024-08-20</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>We investigate how small the Randić index of a graph can be in terms of its matching number, and prove several results. We give best-possible linear bounds for graphs of small excess and for subcubic graphs; in the former case the size of excess we permit is qualitatively the best possible. We show that a linear bound holds for any sparse hereditary graph class (such as planar graphs). In general, however, we show that it can be much smaller than linear. We determine the asymptotic growth rate of the minimum Randić index for graphs with a near perfect matching, and conjecture that the same bounds hold for all graphs.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2024-08
issn 2331-8422
language eng
recordid cdi_proquest_journals_2929277694
source Freely Accessible Journals
subjects Graphs
Lower bounds
Matching
title Lower bounds for the Randić index in terms of matching number
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T19%3A53%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Lower%20bounds%20for%20the%20Randi%C4%87%20index%20in%20terms%20of%20matching%20number&rft.jtitle=arXiv.org&rft.au=Akbari,%20Saieed&rft.date=2024-08-20&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2929277694%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2929277694&rft_id=info:pmid/&rfr_iscdi=true