On the Minimum General Sum-Connectivity of Trees of Fixed Order and Pendent Vertices
For a graph G, its general sum-connectivity is usually denoted by χαG and is defined as the sum of the numbers dGu+dGvα over all edges uv of G, where dGu,dGv represent degrees of the vertices u,v, respectively, and α is a real number. This paper addresses the problem of finding graphs possessing the...
Saved in:
Main Authors: | Abeer M. Albalahi, Akbar Ali |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2022-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2022/8567266 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Extremum Modified First Zagreb Connection Index of n-Vertex Trees with Fixed Number of Pendent Vertices
by: Sadia Noureen, et al.
Published: (2020-01-01) -
Minimum Variable Connectivity Index of Trees of a Fixed Order
by: Shamaila Yousaf, et al.
Published: (2020-01-01) -
On Trees with a Given Number of Vertices of Fixed Degree and Their Two Bond Incident Degree Indices
by: Abeer M. Albalahi, et al.
Published: (2024-12-01) -
A Note on the Minimum Wiener Polarity Index of Trees with a Given Number of Vertices and Segments or Branching Vertices
by: Sadia Noureen, et al.
Published: (2021-01-01) -
On the Laplacian Coefficients and Laplacian-Like Energy of Unicyclic Graphs with n Vertices and m Pendent Vertices
by: Xinying Pai, et al.
Published: (2012-01-01)