Keywords
MathematicsAlgebraic numberDiscrete mathematicsAlgebra over a fieldPure mathematicsMathematical analysis
Related Publications
Spectral Graph Theory
Eigenvalues and the Laplacian of a graph Isoperimetric problems Diameters and eigenvalues Paths, flows, and routing Eigenvalues and quasi-randomness Expanders and explicit const...
On the Quality of Spectral Separators
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there has not been much ...
Numerical operator calculus in higher dimensions
When an algorithm in dimension one is extended to dimension d , in nearly every case its computational cost is taken to the power d . This fundamental difficulty is the single g...
Diffusion Kernels on Graphs and Other Discrete Input Spaces
The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose...
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
We present an O(√nL)-iteration homogeneous and self-dual linear programming (LP) algorithm. The algorithm possesses the following features: • It solves the linear programming pr...
Publication Info
- Year
- 1973
- Type
- article
- Volume
- 23
- Issue
- 2
- Pages
- 298-305
- Citations
- 3871
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
3871
OpenAlex
Cite This
Miroslav Fiedler
(1973).
Algebraic connectivity of graphs.
Czechoslovak Mathematical Journal
, 23
(2)
, 298-305.
https://doi.org/10.21136/cmj.1973.101168
Identifiers
- DOI
- 10.21136/cmj.1973.101168