Graphs with few positive eigenvalues
Let G be a simple graph with vertices v_1,..., v_n. The adjacency matrix of G denoted by A(G) is an n×n matrix whose the entry (i,j) is 1 if v_i and v_j are adjacent and is zero otherwise. By the eigenvalues of G we mean the eigenvalues of A(G). Let λ_1 (G)≥λ_2 (G)≥⋯≥λ_n (G) be the eigenvalues of G. In this paper we obtain some results related to graphs with at most three non-negative eigenvalues. We obtain all non-connected graphs with this property. In addition, we find some families of connected graphs with this property. In particular we study two following families of graphs:1. Graphs such as G with exactly two positive eigenvalues and one zero eigenvalues. In other words graphs such as G with λ_1 (G)>0 , λ_2 (G)>0 , λ_3 (G)=0 and λ_4 (G)0 , λ_2 (G)>0 , λ_3 (G)>0 and λ_4 (G)
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.