The eigenvalues of a graph under edge operations
Authors:
- R. VenkatesanRVR. Venkatesan
- P. ElakkiyaPEP. Elakkiya
- D. Rini DominicDDD. Rini Dominic
Open Access
- 24 June 2019
- conference paper
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2112 (1) , 020137
Abstract
This paper investigates how the Laplacian matrix eigenvalues of a connected graph behaves under adding some edges and subdividing a edge.Keywords
This publication has 6 references indexed in Scilit:
- A Lower Bound for the Algebraic Connectivity of a Graph in Terms of the Domination NumberActa Mathematicae Applicatae Sinica, English Series, 2018
- The algebraic connectivity of graphs under perturbationLinear Algebra and its Applications, 2010
- Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centralityDiscrete Mathematics, 2010
- Old and new results on algebraic connectivity of graphsLinear Algebra and its Applications, 2007
- The Laplacian Spectrum of a GraphSIAM Journal on Matrix Analysis and Applications, 1990
- On the determination of χl,η+−0 AND η000 from bubble chamber measurementsCzechoslovak Journal of Physics, 1975