Bounds on Path Energy of Graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910455479402496 |
|---|---|
| author | Narke, Amol P. Malavadkar, Prashant P. Shikare, Maruti M. |
| author_facet | Narke, Amol P. Malavadkar, Prashant P. Shikare, Maruti M. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2205_05100 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Bounds on Path Energy of Graphs Narke, Amol P. Malavadkar, Prashant P. Shikare, Maruti M. Combinatorics Discrete Mathematics 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. |
| title | Bounds on Path Energy of Graphs |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2205.05100 |