A Fiedler-like theory for the perturbed Laplacian.

DOI10.1007/S10587-016-0288-4zbMATH Open1413.05245OpenAlexW2531476721MaRDI QIDQ2828811FDOQ2828811

Vilmar Trevisan, Israel Rocha

Publication date: 26 October 2016

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/145867

Recommendations

• The perturbed laplacian matrix of a graph
• Perron components and algebraic connectivity for weighted graphs
• On algebraic connectivity as a function of an edge weight
• Sign-changing diagonal perturbations of Laplacian matrices of graphs
• Spectra of Laplacian matrices of weighted graphs: structural genericity properties

zbMATH Keywords

graph partitioningalgebraic connectivityFiedler vectorperturbed Laplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The influence of Miroslav Fiedler on spectral graph theory
• Title not available (Why is that?)
• Characteristic vertices of trees^*
• The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
• Characteristic vertices of weighted trees via perron values
• Perron components and algebraic connectivity for weighted graphs
• The perturbed laplacian matrix of a graph

Cited In (4)

• On algebraic connectivity as a function of an edge weight
• The perturbed laplacian matrix of a graph
• Extreme values of the Fiedler vector on trees
• Sign-changing diagonal perturbations of Laplacian matrices of graphs

This page was built for publication: A Fiedler-like theory for the perturbed Laplacian.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828811)