Structure of Trees with Respect to Nodal Vertex Sets

07/28/2019
by   Asghar Bahmani, et al.
0

Let T be a tree with a given adjacency eigenvalue λ. In this paper, by using the λ-minimal trees, we determine the structure of trees with a given multiplicity of the eigenvalue λ. Furthermore, we consider the relationship between the structure of trees and the eigensystem of a given Laplacian eigenvalue.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/18/2019

Extreme Values of the Fiedler Vector on Trees

Let G be a connected tree on n vertices and let L = D-A denote the Lapla...
research
01/03/2020

Eigenvalue embedding of undamped piezoelectric structure system with no-spillover

In this paper, the eigenvalue embedding problem of the undamped piezoele...
research
12/09/2019

Some observations on the smallest adjacency eigenvalue of a graph

In this paper, we discuss various connections between the smallest eigen...
research
04/11/2019

On the Displacement of Eigenvalues when Removing a Twin Vertex

Twin vertices of a graph have the same common neighbours. If they are ad...
research
07/11/2018

Trees in the Real Field

This paper proposes an algebraic view of trees which opens the doors to ...
research
10/13/2017

On the Ontological Modeling of Trees

Trees -- i.e., the type of data structure known under this name -- are c...
research
06/20/2022

Extremal graph realizations and graph Laplacian eigenvalues

For a regular polyhedron (or polygon) centered at the origin, the coordi...

Please sign up or login with your details

Forgot password? Click here to reset