Article ID Journal Published Year Pages File Type
4599161 Linear Algebra and its Applications 2015 18 Pages PDF
Abstract

Let G be a graph of order n   and let q(G)q(G) be the largest eigenvalue of the signless Laplacian of G  . Let Sn,kSn,k be the graph obtained by joining each vertex of a complete graph of order k   to each vertex of an independent set of order n−kn−k; let Sn,k+ be the graph obtained by adding an edge to Sn,kSn,k.It is shown that if k≥2k≥2, n≥400k2n≥400k2, and G is a graph of order n  , with no cycle of length 2k+22k+2, then q(G)

Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory
Authors
, ,