Abstract
In this paper we investigate the relation between eigenvalue distribution and graph structure of two classes of graphs: the (m,k)-stars and l-dependent graphs. We give conditions on the topology and edge weights in order to get values and multiplicities of Laplacian matrix eigenvalues. We prove that a vertex set reduction on graphs with (m,k)-star subgraphs is feasible, keeping the same eigenvalues with reduced multiplicity. Moreover, some useful eigenvectors properties are derived up to a product with a suitable matrix. Finally, we relate these results with Fiedler spectral partitioning of the graph and the physical relevance of the results is shortly discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.