The eigenvalues of a graph is the root of its characteristic polynomial. A fullerene F is a 3- connected graphs with entirely 12 pentagonal faces and n/2 -10 hexagonal faces, where n is the number of vertices of F. In this paper we investigate the eigenvalues of a class of fullerene graphs.

This study is on the fuzzy eigenvalues and fuzzy eigenfunctions of the Sturm-Liouville fuzzy problem with fuzzy eigenvalue parameter. We find fuzzy eigenvalues and fuzzy eigenfunctions of the problem under the approach of Hukuhara differentiability. We solve an example. We draw the graphics of eigenfunctions. We show that eigenfunctions are valid fuzzy functions or not.

the eigenvalues of a graph is the root of its characteristic polynomial. a fullerene f is a 3-connected graphs with entirely 12 pentagonal faces and n/2 -10 hexagonal faces, where n isthe number of vertices of f. in this paper we investigate the eigenvalues of a class of fullerenegraphs.

Let A be an n×n complex Hermitian matrix and let λ(A)=(λ1,…,λn)∈Rn denote the eigenvalues of A, counting multiplicities arranged in non-increasing order. Motivated by problems arising theory low rank approximation, we study spectral spread denoted Spr+(A), given Spr+(A)=(λ1−λn,λ2−λn−1,…,λk−λn−k+1)∈Rk, where k=[n/2] (integer part). The is a vector-valued measure dispersion spectrum that allows o...

Quantum systems whose states are tightly distributed among several invariant subspaces (variable spin systems) can be described in terms of distributions a four-dimensional phase-space T∗S2 the limit large average angular momentum. The cotangent bundle is also classical manifold for with E(3) symmetry group appropriately fixed Casimir operators. This allows us to employ asymptotic form star-pro...

this paper consists of three sections. in the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. in the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...

in this paper, the deformation of a thick-walled circular cylindrical shell of incompressible isotropic elastic material is considered. the shell, which is made of three-term strain energy function is subjected to the combined external and axial loading pressure. in order to obtain the relevant eigenvalues, which is the main objective of the work, the incremental equilibrium equations are so...

‎let $g$ be a graph with vertex set $v(g)$ and edge set $x(g)$ and consider the set $a={0,1}$‎. ‎a mapping $l:v(g)longrightarrow a$ is called binary vertex labeling of $g$ and $l(v)$ is called the label of the vertex $v$ under $l$‎. ‎in this paper we introduce a new kind of graph energy for the binary labeled graph‎, ‎the labeled graph energy $e_{l}(g)$‎. ‎it depends on the underlying graph $g$...

We study the regularity of the roots of complex monic polynomials P (t) of degree n depending smoothly on a real parameter t. If P (t) is C∞ and no two of the continuously chosen roots meet of infinite order of flatness, then there exists a locally absolutely continuous parameterization of the roots. Simple examples show that the conclusion is best possible. This result will follow from the pro...

The first step in elliptic curve scalar multiplication algorithms based on scalar decompositions using efficient endomorphisms— including Gallant–Lambert–Vanstone (GLV) and Galbraith–Lin–Scott (GLS) multiplication, as well as higher-dimensional and higher-genus constructions—is to produce a short basis of a certain integer lattice involving the eigenvalues of the endomorphisms. The shorter the ...