On the Sombor index of trees with degree restrictions
We study the Sombor index of trees with various degree restrictions. In addition to rediscovering that among all trees with a given degree sequence, the greedy tree minimises the Sombor index and the alternating greedy tree maximises it, we also provide a full characterisation of all trees that have...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| 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 | Andriantiana, Eric O. D Rakotonarivo, Valisoa R. M |
| description | We study the Sombor index of trees with various degree restrictions. In
addition to rediscovering that among all trees with a given degree sequence,
the greedy tree minimises the Sombor index and the alternating greedy tree
maximises it, we also provide a full characterisation of all trees that have
those maximum or minimum values. Moreover, we compare trees with different
degree sequences and deduce a few corollaries. |
| doi_str_mv | 10.48550/arxiv.2404.01442 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2404_01442</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2404_01442</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-32d8b87271063b135cbf430c1fae1cb868a96a9fc566528f51a1d414e29876223</originalsourceid><addsrcrecordid>eNotzr1OwzAUhmEvDFXhAjrhG0jwOf6JM6KKQqVKHdo9sp1jaokmyLFouXvoz_TpXT49jC1A1MpqLV5cPqefGpVQtQClcMb0duDlQHw3Hv2YeRp6OvMx8pKJJn5K5cB7-vwPnmkqOYWSxmF6ZA_RfU30dN8526_e9suParN9Xy9fN5UzDVYSe-ttgw0IIz1IHXxUUgSIjiB4a6xrjWtj0MZotFGDg16BImxtYxDlnD3fbq_u7juno8u_3cXfXf3yD1IVPrg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the Sombor index of trees with degree restrictions</title><source>arXiv.org</source><creator>Andriantiana, Eric O. D ; Rakotonarivo, Valisoa R. M</creator><creatorcontrib>Andriantiana, Eric O. D ; Rakotonarivo, Valisoa R. M</creatorcontrib><description>We study the Sombor index of trees with various degree restrictions. In
addition to rediscovering that among all trees with a given degree sequence,
the greedy tree minimises the Sombor index and the alternating greedy tree
maximises it, we also provide a full characterisation of all trees that have
those maximum or minimum values. Moreover, we compare trees with different
degree sequences and deduce a few corollaries.</description><identifier>DOI: 10.48550/arxiv.2404.01442</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2024-04</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/2404.01442$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2404.01442$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Andriantiana, Eric O. D</creatorcontrib><creatorcontrib>Rakotonarivo, Valisoa R. M</creatorcontrib><title>On the Sombor index of trees with degree restrictions</title><description>We study the Sombor index of trees with various degree restrictions. In
addition to rediscovering that among all trees with a given degree sequence,
the greedy tree minimises the Sombor index and the alternating greedy tree
maximises it, we also provide a full characterisation of all trees that have
those maximum or minimum values. Moreover, we compare trees with different
degree sequences and deduce a few corollaries.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzr1OwzAUhmEvDFXhAjrhG0jwOf6JM6KKQqVKHdo9sp1jaokmyLFouXvoz_TpXT49jC1A1MpqLV5cPqefGpVQtQClcMb0duDlQHw3Hv2YeRp6OvMx8pKJJn5K5cB7-vwPnmkqOYWSxmF6ZA_RfU30dN8526_e9suParN9Xy9fN5UzDVYSe-ttgw0IIz1IHXxUUgSIjiB4a6xrjWtj0MZotFGDg16BImxtYxDlnD3fbq_u7juno8u_3cXfXf3yD1IVPrg</recordid><startdate>20240401</startdate><enddate>20240401</enddate><creator>Andriantiana, Eric O. D</creator><creator>Rakotonarivo, Valisoa R. M</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20240401</creationdate><title>On the Sombor index of trees with degree restrictions</title><author>Andriantiana, Eric O. D ; Rakotonarivo, Valisoa R. M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-32d8b87271063b135cbf430c1fae1cb868a96a9fc566528f51a1d414e29876223</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Andriantiana, Eric O. D</creatorcontrib><creatorcontrib>Rakotonarivo, Valisoa R. M</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Andriantiana, Eric O. D</au><au>Rakotonarivo, Valisoa R. M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Sombor index of trees with degree restrictions</atitle><date>2024-04-01</date><risdate>2024</risdate><abstract>We study the Sombor index of trees with various degree restrictions. In
addition to rediscovering that among all trees with a given degree sequence,
the greedy tree minimises the Sombor index and the alternating greedy tree
maximises it, we also provide a full characterisation of all trees that have
those maximum or minimum values. Moreover, we compare trees with different
degree sequences and deduce a few corollaries.</abstract><doi>10.48550/arxiv.2404.01442</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2404.01442 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2404_01442 |
| source | arXiv.org |
| subjects | Mathematics - Combinatorics |
| title | On the Sombor index of trees with degree restrictions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T18%3A33%3A44IST&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=On%20the%20Sombor%20index%20of%20trees%20with%20degree%20restrictions&rft.au=Andriantiana,%20Eric%20O.%20D&rft.date=2024-04-01&rft_id=info:doi/10.48550/arxiv.2404.01442&rft_dat=%3Carxiv_GOX%3E2404_01442%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 |