Pages that link to "Item:Q4391459"

The following pages link to Extremizing algebraic connectivity subject to graph theoretic constraints (Q4391459):

Displaying 50 items.

• Extremizing first eigenvalue of 3-colored digraphs made with given blocks (Q277134) (← links)
• The influence of Miroslav Fiedler on spectral graph theory (Q389537) (← links)
• On the distance Laplacian spectra of graphs (Q405928) (← links)
• The smallest values of algebraic connectivity for unicyclic graphs (Q602680) (← links)
• The algebraic connectivity of lollipop graphs (Q632471) (← links)
• Algebraic connectivity of connected graphs with fixed number of pendant vertices (Q659677) (← links)
• On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian (Q732077) (← links)
• Upper bounds on algebraic connectivity via convex optimization (Q855560) (← links)
• On the Laplacian spectral radius of trees with fixed diameter (Q865423) (← links)
• Old and new results on algebraic connectivity of graphs (Q876302) (← links)
• Absolute algebraic connectivity of double brooms and trees (Q908315) (← links)
• Algebraic connectivity and degree sequences of trees (Q959888) (← links)
• A survey of automated conjectures in spectral graph theory (Q962119) (← links)
• Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality (Q965973) (← links)
• The algebraic connectivity of graphs under perturbation (Q989054) (← links)
• A conjecture on the algebraic connectivity of connected graphs with fixed girth (Q998451) (← links)
• Some results on the Laplacian eigenvalues of unicyclic graphs (Q1014473) (← links)
• First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph (Q1025507) (← links)
• The ordering of unicyclic graphs with the smallest algebraic connectivity (Q1043949) (← links)
• On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering (Q1044553) (← links)
• Some minimax problems for graphs (Q1309451) (← links)
• A note on limit points for algebraic connectivity (Q1414125) (← links)
• Minimizing algebraic connectivity over connected graphs with fixed girth (Q1613533) (← links)
• A lower bound for the algebraic connectivity of a graph in terms of the domination number (Q1617025) (← links)
• Augmenting the algebraic connectivity for certain families of graphs (Q1634763) (← links)
• The maximum relaxation time of a random walk (Q1795486) (← links)
• A tight upper bound on the spectral radius of bottleneck matrices for graphs (Q2002805) (← links)
• Perron value and moment of rooted trees (Q2062813) (← links)
• Perron values and classes of trees (Q2074970) (← links)
• New conjectures on algebraic connectivity and the Laplacian spread of graphs (Q2144238) (← links)
• Ordering trees and graphs with few cycles by algebraic connectivity (Q2250940) (← links)
• On the sum of the two largest Laplacian eigenvalues of trees (Q2258642) (← links)
• Maximizing algebraic connectivity for certain families of graphs (Q2261533) (← links)
• Graphs of given order and size and minimum algebraic connectivity (Q2427902) (← links)
• Ordering trees with algebraic connectivity and diameter (Q2459973) (← links)
• The effect on the algebraic connectivity of a tree by grafting or collapsing of edges (Q2469512) (← links)
• The algebraic connectivity of graphs with given circumference (Q2632019) (← links)
• The algebraic connectivity of two trees connected by an edge of infinite weight (Q2701754) (← links)
• Maximizing the algebraic connectivity for a subclass of caterpillars (Q2840516) (← links)
• Algebraic connectivity on a subclass of caterpillars (Q2840700) (← links)
• On algebraic connectivity of graphs with at most two points of articulation in each block (Q2895688) (← links)
• Algebraic connectivity of trees with the maximum degree (Q3109344) (← links)
• Maximizing Algebraic Connectivity Over Unicyclic Graphs (Q4460635) (← links)
• Minimizing algebraic connectivity over graphs made with some given blocks (Q4632255) (← links)
• Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs (Q4643717) (← links)
• Finding diverse ways to improve algebraic connectivity through multi-start optimization (Q4958813) (← links)
• A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs (Q5126341) (← links)
• Hamiltonian graphs of given order and minimum algebraic connectivity (Q5206285) (← links)
• Surgery principles for the spectral analysis of quantum graphs (Q5234516) (← links)
• Efficient rewirings for enhancing synchronizability of dynamical networks (Q5246312) (← links)