Signed (0,2)‐graphs with few eigenvalues and a symmetric spectrum

نویسندگان

چکیده

We investigate properties of signed graphs that have few distinct eigenvalues together with a symmetric spectrum. Our main contribution is to determine all rectagraphs (triangle-free ( 0 , 2 ) $(0,2)$ -graphs) vertex degree at most 6 precisely two ± λ $\pm \lambda $ . Next, we consider what extent induced subgraphs graph are determined by their spectra. Lastly, classify spectrum three and give partial classification for -graphs four eigenvalues.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graphs with many valencies and few eigenvalues

Dom de Caen posed the question whether connected graphs with three distinct eigenvalues have at most three distinct valencies. We do not answer this question, but instead construct connected graphs with four and five distinct eigenvalues and arbitrarily many distinct valencies. The graphs with four distinct eigenvalues come from regular two-graphs. As a side result, we characterize the disconne...

متن کامل

Eigenvalues of some signed graphs with negative cliques

In a signed graph G, a negative clique is a complete subgraph having negative edges only. In this article, we give characteristic polynomial expressions, and eigenvalues of some signed graphs having negative cliques. This includes signed cycle graph, signed path graph, a complete graph with disjoint negative cliques, and star block graph with negative cliques.

متن کامل

Centrally Symmetric Manifolds with Few Vertices

A centrally symmetric 2d-vertex combinatorial triangulation of the product of spheres S × Sd−2−i is constructed for all pairs of non-negative integers i and d with 0 ≤ i ≤ d − 2. For the case of i = d − 2 − i, the existence of such a triangulation was conjectured by Sparla. The constructed complex admits a vertex-transitive action by a group of order 4d. The crux of this construction is a defin...

متن کامل

Signed Quivers, Symmetric Quivers, and Root Systems.

We define a special sort of weighted oriented graphs, signed quivers. Each of these yields a symmetric quiver, i.e., a quiver endowed with an involutive anti-automorphism and the inherited signs. We develop a representation theory of symmetric quivers, in particular we describe the indecom-posable symmetric representations. Their dimensions constitute root systems corresponding to certain symme...

متن کامل

Graphs with few distinct distance eigenvalues irrespective of the diameters

The distance matrix of a simple connected graph G is D(G) = (dij), where dij is the distance between ith and jth vertices of G. The multiset of all eigenvalues of D(G) is known as the distance spectrum of G. Lin et al.(On the distance spectrum of graphs. Linear Algebra Appl., 439:1662-1669, 2013) asked for existence of graphs other than strongly regular graphs and some complete k-partite graphs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Designs

سال: 2022

ISSN: ['1520-6610', '1063-8539']

DOI: https://doi.org/10.1002/jcd.21828