2 papers
math.CO2026
Connected graphs having maximum signless Laplacian spectral radius
Di-Jian Wang, Hong-Yan Ge, Shi-Cai Gong +1
Let denote the signless Laplacian spectral radius of a graph , and let be the family of connected graphs of order and size . A graph is -maxi…
math.CO2024
The number of dissociation sets in connected graphs
Bo-Jun Yuan, Ni Yang, Hong-Yan Ge +1
Extremal problems related to the enumeration of graph substructures, such as independent sets, matchings, and induced matchings, have become a prominent area of research with the a…