Algebraic connectivity

Known as: Algebraic connectivity of a graph, Fiedler Vector, Fiedler value 
The algebraic connectivity of a graph G is the second-smallest eigenvalue of the Laplacian matrix of G. This eigenvalue is greater than 0 if and only… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
The analysis of matrices associated with discrete, pairwise comparisons can be a very useful toolbox for a computer scientist. In… (More)
  • figure 3.4
Is this relevant?
2014
2014
It is necessary to design a robust air transportation network. An experiment based on the real air transportation network is… (More)
  • figure 1
  • table I
  • table III
  • figure 2
  • figure 4
Is this relevant?
2013
2013
The algebraic connectivity μN−1, i.e. the second smallest eigenvalue of the Laplacian matrix, plays a crucial role in dynamic… (More)
Is this relevant?
2012
2012
We generalize Laplacian matrices for graphs to Laplacian tensors for even uniform hypergraphs and set some foundations for the… (More)
Is this relevant?
2008
2008
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The ability of a robot team to reconfigure itself is useful in many applications: for metamorphic robots to change shape, for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We study the algebraic connectivity in relation to the graph's robustness to node and link failures. Graph's robustness is… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Review
2007
Review
2007
This paper is a survey of the second smallest eigenvalue of the Laplacian of a graph G, best-known as the algebraic connectivity… (More)
  • table 3.1
  • table 3.2
  • table 4.1
  • table 4.2
  • table 4.3
Is this relevant?
2007
2007
In this paper, we explore spectral properties of a class of regular Cayley graphs known as Ramanujan graphs and prove that the… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?