The signless Laplacian spectral radius of graphs without intersecting odd cycles (Q6628846)

In this paper, the authors present a sharp bound for the signless Laplacian spectral radius of a graph, consisting of \(k\) cycles of odd length, where \(k\) is a positive integer that intersects in one common vertex. They also characterize all extremal graphs that attain the bound.\N\NA good revision of this subject appears in the Introduction, with many references. The main result of this paper is Theorem 1.7. It is an important result in this matter.\N\NIn Section 3 we have the proof of the main result and in Section 2 the authors write some known lemmas necessary for the proof.\N\NThe proof of the main result is easy to read because the authors divide it into several lemmas and claims.\N\NI think this is one of the first of many other works on this interesting subject.