Graphs cospectral with starlike trees
نویسندگان
چکیده
A tree which has exactly one vertex of degree greater than two is said to be starlike. In spite of seemingly simple structure of these trees, not much is known about their spectral properties. In this paper, we introduce a generalization of the notion of cospectrality called m-cospectrality which turns out to be useful in constructing cospectral graphs. Based on this, we construct cospectral mates for some starlike trees. We also present a set of necessary and sufficient conditions for divisibility of the characteristic polynomial of a starlike tree by the characteristic polynomial of a path. AMS Subject Classification: 05C50.
منابع مشابه
Cospectral Bipartite Graphs for the Normalized Laplacian Table of Contents
We construct two infinite families of trees that are pairwise cospectral with respect to the normalized Laplacian. We also use the normalized Laplacian applied to weighed graphs to give new constructions of cospectral pairs of bipartite unweighted graphs.
متن کاملCharacteristics polynomial of normalized Laplacian for trees
Here, we find the characteristics polynomial of normalized Laplacian of a tree. The coefficients of this polynomial are expressed by the higher order general Randić indices for matching, whose values depend on the structure of the tree. We also find the expression of these indices for starlike tree and a double-starlike tree, Hm(p, q). Moreover, we show that two cospectral Hm(p, q) of the same ...
متن کاملOpen problems for equienergetic graphs
The energy of a graph is equal to the sum of the absolute values of its eigenvalues. Two graphs of the same order are said to be equienergetic if their energies are equal. We point out the following two open problems for equienergetic graphs. (1) Although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known how to systematically construct any such pa...
متن کاملPerfect Domination with Forbidden Vertices on lk-starlike Graphs and Trees
Let G(V, E) be a graph with n-vertex-set V and m-edge-set E. Meanwhile, each vertex v is associated with a nonnegative weight W(v). Given a subset F of V, this paper studies the problem of finding a perfect dominating set D such that δ(D) = ∑ is minimized under the restriction that D ⊆ (V F). The vertices in F are called forbidden vertices. We first define a new class of graphs, called l ∈D v D...
متن کاملCospectral graphs for the normalized Laplacian by “toggling”
A characteristic of the normalized Laplacian matrix is the possibility for cospectral graphs which do not have the same number of edges. We give a construction of an infinite family of weighted graphs that are pairwise cospectral and which can be transformed into simple graphs. In particular, some of these graphs are cospectral with subgraphs of themselves. In the proof we deconstruct these gra...
متن کامل