Abstract
A propeller graph is obtained from an ∞-graph by attaching a path to the vertex of degree four, where an ∞-graph consists of two cycles with precisely one common vertex. In this paper, it is proved that all propeller graphs are determined by their Laplacian spectra as well as their signless Laplacian spectra.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
