adjacency_spectral_radius
def
The adjacency spectral radius of a simple graph G on a finite vertex set is the spectral radius of its real adjacency matrix.
Statement
noncomputable def adjacency_spectral_radius {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) : ENNReal
- Defined in
- arXiv:2610.17078 Section 2
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Used by 16
- op223_example_spectral_upperThe spectral radius of the eight-vertex example tree is at most 209/100.
- is_spectrally_sustainable_edgeAn edge e in a simple graph G on a finite vertex set is spectrally sustainable if there exists a non-edge f of G such that deleting e and…
- op223_first_replacement_spectral_lowerReplacing edge 0-1 with 4-2 in the example tree yields a graph whose spectral radius is greater than 209/100.
- op223_local_principal_maxima_not_sufficientThere is a tree on exactly three vertices with an edge uv that can be replaced by a nonedge so that the result remains a tree and has…
- spectral_extremal_chromatic_numberFor an integer k ≥ 1 and real number r, the extremal distance-k chromatic number under spectral radius constraint r, denoted χ_λ(k, r), is…
- no_sustainable_tree_fin_twoNo simple graph on the two-element vertex type Fin 2 is a sustainable tree: a tree there has one edge and the complement has no edge at…
- not_op223_path_is_sustainableThe statement
op223_path_is_sustainableis false: The statement fails at n = 2.SimpleGraph.pathGraph 2 = SimpleGraph.hasse (Fin 2)is… - op223_nonsustainable_tree_fin_fourEvery non-sustainable tree on four vertices is isomorphic to the star graph K_{1,3}.
- op223_no_nonsustainable_tree_fin_threeThere are no non-sustainable trees on three vertices.
- is_sustainable_edgeAn edge e in a tree T is sustainable if there exists a non-edge f such that T - e + f is a tree and the adjacency spectral radius of T - e…
- nonsustainable_star_connectivity_of_ascent_stepIf every non-sustainable tree on Fin n (n ≥ 2) that is not a star has a non-sustainable generalized-tree-shift successor with strictly…
- spectral_extremal_clique_numFor an integer k ≥ 1 and real number r, the extremal distance-k clique number under spectral radius constraint r, denoted ω_λ(k, r), is…
- op223_example_graph_edge_01_sustainableEdge 0-1 in op223_example_graph is sustainable.
- sustainable_path_connectivity_of_descent_stepIf every sustainable tree on Fin n (n ≥ 1) that is not a path has a sustainable generalized-tree-shift predecessor with strictly smaller…
- is_perron_vectorFor a simple graph G on a finite vertex type V, a vector vec : V → ℝ is a Perron vector if every component vec i is strictly positive and…
- spectral_extremal_clique_num_le_chromatic_numberFor every natural number k and real number r, the extremal distance-k clique number spectral_extremal_clique_num k r is less than or equal…
Read back from the Lean
For any type V with [Fintype V] and [DecidableEq V], and any simple graph G : SimpleGraph V, adjacency_spectral_radius G is defined as the spectral radius over ℝ of the real adjacency matrix G.adjMatrix ℝ, valued in ENNReal.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The adjacency spectral radius of a simple graph on a finite vertex set. -/ noncomputable def adjacency_spectral_radius {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) : ENNReal := open scoped Classical in spectralRadius ℝ (G.adjMatrix ℝ)