نتایج جستجو برای: graphs with exactly two non negative eigenvalues
تعداد نتایج: 10414518 فیلتر نتایج به سال:
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
Let Γ be a distance-regular graph with diameter d and Kneser graph K = Γd, the distance-d graph of Γ. We say that Γ is partially antipodal when K has fewer distinct eigenvalues than Γ. In particular, this is the case of antipodal distance-regular graphs (K with only two distinct eigenvalues), and the so-called half-antipodal distance-regular graphs (K with only one negative eigenvalue). We prov...
We prove a quantitative version of result Torgašev concerning graphs with fixed number negative eigenvalues. also establish structural stating that if for hereditary family every graph order N+1 and N+2 has false twins, then from this greater than N twins.
abstract the current study examined the role of emotional intelligence and motivation on language learning of efl learners in iranian context. the participants of this study were 162 female and 100 male junior high school students. these participants were selected by convenient sampling method. to carry out the study two questionnaires were administered to the participants. first, the adap...
building on previous studies on intellectual features and learners’ grammar learning, the present study aimed at investigating whether intelligence criterion had any impact on efl learners’ english grammar learning across two intelligence levels. in the current study, the participants were divided into two experimental and control groups by administration of raven i.q. test. this led to the for...
Dom de Caen posed the question whether connected graphs with three distinct eigenvalues have at most three distinct valencies. We do not answer this question, but instead construct connected graphs with four and five distinct eigenvalues and arbitrarily many distinct valencies. The graphs with four distinct eigenvalues come from regular two-graphs. As a side result, we characterize the disconne...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید