Some trees characterized by eigenvalues and angles
نویسندگان
چکیده
منابع مشابه
An algorithm for constructing graphs with given eigenvalues and angles
Let the eigenvalues of a graph and the angles between eigenspaces and the co-ordinate axes of the corresponding real vector space be given for a graph. Cvetković [2] gave a method of constructing a graph which is the supergraph of all graphs with given eigenvalues and angles. Based on this, we describe a branch & bound algorithm for constructing all graphs with given eigenvalues and angles.
متن کاملTrees with Convex Faces and Optimal Angles
We consider drawings of trees in which all edges incident to leaves can be extended to infinite rays without crossing, partitioning the plane into infinite convex polygons. Among all such drawings we seek the one maximizing the angular resolution of the drawing. We find linear time algorithms for solving this problem, both for plane trees and for trees without a fixed embedding. In any such dra...
متن کاملConstructing fullerene graphs from their eigenvalues and angles
We discuss means of constructing fullerene graphs from their eigenvalues and angles. An algorithm for such a construction is given. © 2002 Elsevier Science Inc. All rights reserved.
متن کاملOn Multiple Eigenvalues of Trees
Let T be a tree of order n > 6 with μ as a positive eigenvalue of multiplicity k. Star complements are used to show that (i) if k > n/3 then μ = 1, (ii) if μ = 1 then, without restriction on k, T has k+ 1 pendant edges that form an induced matching. The results are used to identify the trees with a non-zero eigenvalue of maximum possible multiplicity.
متن کاملEdge-disjoint spanning trees and eigenvalues
Article history: Received 17 July 2013 Accepted 25 November 2013 Available online 13 December 2013 Submitted by R. Brualdi MSC: 05C50 15A18 15A42
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications de l'Institut Mathematique
سال: 2006
ISSN: 0350-1302
DOI: 10.2298/pim0693019s