Bounds on Path Energy of Graphs
Given a graph $M,$ path eigenvalues are eigenvalues of its path matrix. The path energy of a simple graph $M$ is equal to the sum of the absolute values of the path eigenvalues of the graph $M$ (Shikare et. al, 2018). We have discovered new upper constraints on path energy in this study, expressed i...
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 | Narke, Amol P Malavadkar, Prashant P Shikare, Maruti M |
| description | Given a graph $M,$ path eigenvalues are eigenvalues of its path matrix. The
path energy of a simple graph $M$ is equal to the sum of the absolute values of
the path eigenvalues of the graph $M$ (Shikare et. al, 2018). We have
discovered new upper constraints on path energy in this study, expressed in
terms of a graph's maximum degree. Additionally, a relationship between a
graph's energy and path energy is given. |
| doi_str_mv | 10.48550/arxiv.2205.05100 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2205_05100</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2205_05100</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2205_051003</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjIw1TMwNTQw4GSQd8ovzUspVsjPUwhILMlQcM1LLUqvVMhPU3AvSizIKOZhYE1LzClO5YXS3Azybq4hzh66YKPiC4oycxOLKuNBRsaDjTQmrAIAfCEpmQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Bounds on Path Energy of Graphs</title><source>arXiv.org</source><creator>Narke, Amol P ; Malavadkar, Prashant P ; Shikare, Maruti M</creator><creatorcontrib>Narke, Amol P ; Malavadkar, Prashant P ; Shikare, Maruti M</creatorcontrib><description>Given a graph $M,$ path eigenvalues are eigenvalues of its path matrix. The
path energy of a simple graph $M$ is equal to the sum of the absolute values of
the path eigenvalues of the graph $M$ (Shikare et. al, 2018). We have
discovered new upper constraints on path energy in this study, expressed in
terms of a graph's maximum degree. Additionally, a relationship between a
graph's energy and path energy is given.</description><identifier>DOI: 10.48550/arxiv.2205.05100</identifier><language>eng</language><subject>Computer Science - Discrete Mathematics ; Mathematics - Combinatorics</subject><creationdate>2022-05</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/2205.05100$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2205.05100$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Narke, Amol P</creatorcontrib><creatorcontrib>Malavadkar, Prashant P</creatorcontrib><creatorcontrib>Shikare, Maruti M</creatorcontrib><title>Bounds on Path Energy of Graphs</title><description>Given a graph $M,$ path eigenvalues are eigenvalues of its path matrix. The
path energy of a simple graph $M$ is equal to the sum of the absolute values of
the path eigenvalues of the graph $M$ (Shikare et. al, 2018). We have
discovered new upper constraints on path energy in this study, expressed in
terms of a graph's maximum degree. Additionally, a relationship between a
graph's energy and path energy is given.</description><subject>Computer Science - Discrete Mathematics</subject><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjIw1TMwNTQw4GSQd8ovzUspVsjPUwhILMlQcM1LLUqvVMhPU3AvSizIKOZhYE1LzClO5YXS3Azybq4hzh66YKPiC4oycxOLKuNBRsaDjTQmrAIAfCEpmQ</recordid><startdate>20220510</startdate><enddate>20220510</enddate><creator>Narke, Amol P</creator><creator>Malavadkar, Prashant P</creator><creator>Shikare, Maruti M</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20220510</creationdate><title>Bounds on Path Energy of Graphs</title><author>Narke, Amol P ; Malavadkar, Prashant P ; Shikare, Maruti M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2205_051003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Discrete Mathematics</topic><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Narke, Amol P</creatorcontrib><creatorcontrib>Malavadkar, Prashant P</creatorcontrib><creatorcontrib>Shikare, Maruti M</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>Narke, Amol P</au><au>Malavadkar, Prashant P</au><au>Shikare, Maruti M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Bounds on Path Energy of Graphs</atitle><date>2022-05-10</date><risdate>2022</risdate><abstract>Given a graph $M,$ path eigenvalues are eigenvalues of its path matrix. The
path energy of a simple graph $M$ is equal to the sum of the absolute values of
the path eigenvalues of the graph $M$ (Shikare et. al, 2018). We have
discovered new upper constraints on path energy in this study, expressed in
terms of a graph's maximum degree. Additionally, a relationship between a
graph's energy and path energy is given.</abstract><doi>10.48550/arxiv.2205.05100</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2205.05100 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2205_05100 |
| source | arXiv.org |
| subjects | Computer Science - Discrete Mathematics Mathematics - Combinatorics |
| title | Bounds on Path Energy of Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T19%3A41%3A35IST&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=Bounds%20on%20Path%20Energy%20of%20Graphs&rft.au=Narke,%20Amol%20P&rft.date=2022-05-10&rft_id=info:doi/10.48550/arxiv.2205.05100&rft_dat=%3Carxiv_GOX%3E2205_05100%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 |