Abstract We introduce and investigate the solvable graph _ S (L) Γ S (L) of a finite-dimensional Lie algebra L over a field F. The vertices are the elements outside the solvabilizer sol (L) sol (L), and two vertices are adjacent whenever they generate a solvable subalgebra. After developing the basic properties of solvabilizers and S -Lie algebras, we establish divisibility conditions, coset decompositions, and degree constraints for solvable graphs. Explicit examples, such as sl₂ (F₃) sl 2 (F 3), illustrate that solvable graphs may be non-connected, in sharp contrast with the group-theoretic setting. We further determine the degree sequences of _ S (gl₂ (Fq) ) Γ S (gl 2 (F q) ) and _ S (sl₂ (Fq) ) Γ S (sl 2 (F q) ), highlighting how spectral types of matrices dictate combinatorial patterns. An algorithmic framework based on GAP and SageMath is also provided for practical computations. Our results reveal both analogies and differences with the nilpotent graph of Lie algebras, and suggest that solvable graphs encode structural invariants in a genuinely new way. This work opens the door to a broader graphical approach to solvability in Lie theory.
Towers et al. (2026) studied this question.