A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues

Keyphrases

• Strongly Regular Graph 100%
• Signless Laplacian Eigenvalue 100%
• G-Lets 50%
• Maximum Degree 50%
• Largest Eigenvalue 50%
• Adjacent Vertices 50%
• Simple Graph 50%
• Common Neighbors 50%
• Signless Laplacian Matrix 50%

Mathematics

• Eigenvalue 100%
• Laplace Operator 100%
• Strongly Regular Graph 100%
• Simple Graph 50%
• Maximum Degree 50%
• Distinct Vertex 50%
• Laplacian Matrix 50%