Xinxuan Chen

Spectral radius and Hamiltonicity in generalized split graphs

A graph G ˆ is a split graph if its vertex set can be partitioned into a clique S and an independent set I , and the cross edges join a vertex in S to a vertex in I . A generalized split graph G is obtained from the split graph G ˆ by replacing each vertex v of I with a clique S...