Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

DM
2016

favoriteEmaildiscussreport

37views more DM 2016»

Integral trees with given nullity

8 years 7 months ago

Integral trees with given nullity

Download math.ipm.ac.ir

A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only ﬁnitely many integral trees. Integral trees with nullity at most 1 were already characterized by Watanabe and Brouwer. It is shown that integral trees with nullity 2 and 3 are unique.

Real-time Traffic

DM 2016 |

claim paper

Related Content

» Distances between pairs of vertices and vertical profile in conditioned GaltonWatson trees

» iGTP A software package for largescale gene tree parsimony analysis

» Integrating Correction into Incremental Validation

» An Effective BranchandBound Algorithm for Convex Quadratic Integer Programming

» PUBLIC A Decision Tree Classifier that Integrates Building and Pruning

» On TreeConstrained Matchings and Generalizations

» On the cost of searching signature trees

» Minimum moment Steiner trees

» SampleBased Planning for Continuous Action Markov Decision Processes

» An Improved LPbased Approximation for Steiner Tree

Post Info
More Details (n/a)

Added	01 Apr 2016
Updated	01 Apr 2016
Type	Journal
Year	2016
Where	DM

Comments (0)