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

Fan, Feng; Weng, Chih-wen

doi:10.1016/j.laa.2016.05.009

Linear Algebra and its Applications

2016

DOI: 10.1016/j.laa.2016.05.009

|View full text |Cite

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

Feng Fan

Chih-wen Weng

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

2024

Publication Types

Select...

Article4

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues

Sander,

Sander

2023

J Algebr Comb

View full text Add to dashboard Cite

We present a method which in principal allows to characterise all integral circulant graphs with multiplicative divisor set having a spectrum, i.e. the set of distinct eigenvalues, of any given size. We shall exemplify the method for spectra of up to four eigenvalues, also reproving some known results for three eigenvalues along the way. In particular we show that given any integral circulant graph of arbitrary order n with multiplicative divisor set and precisely four distinct eigenvalues, n necessarily is either a prime power or the product of two prime powers with explicitly given simply structured divisor set and set of eigenvalues in both cases.

show abstract

Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues

Sander,

Sander

2023

J Algebr Comb

View full text Add to dashboard Cite

show abstract

Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs

Liu

2019

Appl. Math. J. Chin. Univ.

View full text Add to dashboard Cite

Bounds for the spectral radius of the $$A_{\alpha }$$-matrix of graphs

Alhevaz

Ganie²

2023

Indian J Pure Appl Math

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

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

Cited by 4 publications

References 12 publications

Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues

Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues

Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs

Bounds for the spectral radius of the $$A_{\alpha }$$-matrix of graphs

Contact Info

Product

Resources

About