Characterization of students through generalized spectral decomposition

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating links through spectral decomposition

Spectral decomposition has been rarely used to investigate complex networks. In this work we apply this concept in order to define two types of linkdirected attacks while quantifying their respective effects on the topology. Several other types of more traditional attacks are also adopted and compared. These attacks had substantially diverse effects, depending on each specific network (models a...

متن کامل

Generalized spectral decomposition for stochastic nonlinear problems

We present an extension of the Generalized Spectral Decomposition method for the resolution of non-linear stochastic problems. The method consists in the construction of a reduced basis approximation of the Galerkin solution and is independent of the stochastic discretization selected (polynomial chaos, stochastic multi-element or multiwavelets). Two algorithms are proposed for the sequential c...

متن کامل

Spectral Characterization of Generalized Cocktail-Party Graphs

In the paper, we prove that all generalized cocktail-party graphs with order at least 23 are determined by their adjacency spectra.

متن کامل

Spectral Characterization of Some Generalized Odd Graphs

Suppose G is a connected, k-regular graph such that Spec…G† ˆ Spec…G† where G is a distance-regular graph of diameter d with parameters a1 ˆ a2 ˆ ˆ adÿ1 ˆ 0 and ad > 0; i.e., a generalized odd graph, we show that G must be distance-regular with the same intersection array as that of G in terms of the notion of Ho ̈man Polynomials. Furthermore, G is isomorphic to G if G is one of the odd polygon ...

متن کامل

Generalized Spectral Characterization of Graphs Revisited

A graph G is said to be determined by its generalized spectrum (DGS for short) if for any graph H, H and G are cospectral with cospectral complements implies that H is isomorphic to G. Wang and Xu (2006) gave some methods for determining whether a family of graphs are DGS. In this paper, we shall review some of the old results and present some new ones along this line of research. More precisel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kodo Keiryogaku (The Japanese Journal of Behaviormetrics)

سال: 1998

ISSN: 0385-5481,1880-4705

DOI: 10.2333/jbhmk.25.38