Abstract
We characterize all graphs for which there are eigenvectors of the graph Laplacian having all their components in {−1,+1} or {−1,0,+1}. Graphs having eigenvectors with components in {−1,+1} are called bivalent and are shown to be the regular bipartite graphs and their extensions obtained by adding edges between vertices with the same value for the given eigenvector. Graphs with eigenvectors with components in {−1,0,+1} are called trivalent and are shown to be soft-regular graphs – graphs such that vertices associated with non-zero components have the same degree – and their extensions via certain transformations.
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.
