Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.05300 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913345016168448 |
|---|---|
| author | Hamoud, Jasem Kurnosov, Artem |
| author_facet | Hamoud, Jasem Kurnosov, Artem |
| contents | The sigma index in graph theory refers to a measure of the degree differences between vertices in a graph. The goal is to determine the graphs that have the maximum sigma index within certain classes of graphs. Abdo, Dimitrov, and Gutman characterized the graphs with the greatest sigma index among all connected graphs of a fixed order. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_05300 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Sigma index in Trees with Given Degree Sequences Hamoud, Jasem Kurnosov, Artem General Mathematics 2010: 05C20, 05C69 G.2.2 The sigma index in graph theory refers to a measure of the degree differences between vertices in a graph. The goal is to determine the graphs that have the maximum sigma index within certain classes of graphs. Abdo, Dimitrov, and Gutman characterized the graphs with the greatest sigma index among all connected graphs of a fixed order. |
| title | Sigma index in Trees with Given Degree Sequences |
| topic | General Mathematics 2010: 05C20, 05C69 G.2.2 |
| url | https://arxiv.org/abs/2405.05300 |