Genericity of simple eigenvalues for a metric graph
نویسندگان
چکیده
منابع مشابه
Genericity of Simple Eigenvalues for a Metric Graph
Let Γ be a connected finite graph; by V we denote the set of its vertices, and by E we denote the set of its edges. In a contrast with a combinatorial graph, each edge e is considered to be a line segment of length l(e). Sometimes, it is convenient to treat each edge as a pair of oriented edges; then, on an oriented edge, one defines a coordinate xe that runs from 0 to l(e). If −e is the same e...
متن کاملExtremal Properties of Eigenvalues for a Metric Graph
Let Γ be a connected finite graph; by V we denote the set of its vertices, and by E we denote the set of its edges. If each edge e is considered as a segment of certain length l(e) > 0 then such a graph is called a metric graph. One can find a good survey and numerous references in [K]. A metric graph with a given combinatorial structure Γ is determined by a vector of edge lengths (l(e)) ∈ R + ...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملa mathematically simple method based on de nition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
in this paper, a fundamentally new method, based on the de nition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. some examples are provided to show the accuracy and reliability of the proposed method. it is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to t...
متن کاملBounds for Eigenvalues of a Graph
New lower bounds for eigenvalues of a simple graph are derived. Upper and lower bounds for eigenvalues of bipartite graphs are presented in terms of traces and degree of vertices. Finally a non-trivial lower bound for the algebraic connectivity of a connected graph is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2005
ISSN: 0021-2172,1565-8511
DOI: 10.1007/bf02773531