Sigma index in Trees with Given Degree Sequences

2024/05/08 by Jasem Hamoud, Hamoud, Jasem, Artem Kurnosov +1 · 1 citation
Mathematics · Chemistry · Physics and Astronomy · #Graph theory and applications #History and advancements in chemistry #Advanced Mathematical Theories and Applications

paper · pdf · doi:10.48550/arxiv.2405.05300

Abstract

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.

Cited by

• Bounds of Trees with Degree Sequence-Based Topological Indices on Specialized Graph Classes

Related

• Degree Sequence of Albertson and σ-Indices on Trees of Order n\geqslant 3
• Closed-Form Analysis and Extremal Bounds of Albertson and Sigma Indices in Trees with Prescribed Degree Sequences
• Extremal Bounds on the Sigma and Albertson Indices for Non-Decreasing Degree Sequences
• On the Maximum Sigma Index of k-Cyclic Graphs
• Regularities of Typical Sigma Index on Caterpillar Trees of Pendent Vertices