Abstract. Let 𝐺 be a connected claw-free graph on 𝑛 vertices and Ḡ be its complement. Let 𝜇 (𝐺) be the spectral radius of 𝐺. Denote by 𝑁𝑛−3,3 the graph consisting of 𝐾𝑛−3 and three disjoint ...

We consider the skew Laplacian matrix of a digraph G → obtained by giving an arbitrary direction to the edges of a graph G having n vertices and m edges. We obtain an upper bound for the skew ...

For example, novel studies in spectral graph theory have advanced our understanding of the signless Laplacian matrix and the Aα‐matrix, yielding improved lower bounds on the spectral radius and ...

Example Find the equation of a circle with radius 3 units and centre (0, 0). The radius, r = 3 and r 2 = 9, so the equation of the circle is x 2 + y 2 = 9.