applied mathematics
谱极值图
Spectral extremal graphsA graph theory concept involving the study of the maximum or minimum possible values of a graph's spectral parameter (such as the largest eigenvalue of the adjacency matrix) among all graphs of a given order that satisfy a specific property. / 图论概念，涉及研究满足特定性质的给定阶数所有图中，图谱参数（如邻接矩阵的最大特征值）的最大或最小可能值。
- Knowledge type
- 数学理论
- First proposed or discovered
- Proposer
- Turkey Farm member
- Creator
- 农场主
- Last updated
- 2026-11-10 16:06:27
Sub-knowledge points
No connected node yet
Higher-order knowledge points
No connected node yet
Main parameters and performance indicators
F6-free: The graph does not contain a specific subgraph as a minor or topological subgraph.even size: The number of vertices in the graph is an even integer.
Open problems
No unresolved problem recorded yet
Related literature
ranked by community starsSpectral extremal graphs for F6-free graphs with even sizeOpen source
Related products and links
No item recorded yet
Creation and modification trail
1 recordsRecord title: Spectral extremal graphs.
Node update feedback
review required