Line graphs of complex unit gain graphs with least eigenvalue -2

نویسندگان

چکیده

Let $\mathbb T$ be the multiplicative group of complex units, and let $\mathcal L (\Phi)$ denote a line graph $\mathbb{T}$-gain $\Phi$. Similarly to what happens in context signed graphs, real number $\min Spec(A(\mathcal (\Phi))$, that is, smallest eigenvalue adjacency matrix L(\Phi)$, is not less than $-2$. The structural conditions on $\Phi$ ensuring (\Phi))=-2$ are identified. When such fulfilled, bases $-2$-eigenspace constructed with aid star complement technique.

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Notes on graphs with least eigenvalue at least -2

A new proof concerning the determinant of the adjacency matrix of the line graph of a tree is presented and an invariant for line graphs, introduced by Cvetković and Lepović, with least eigenvalue at least −2 is revisited and given a new equivalent definition [D. Cvetković and M. Lepović. Cospectral graphs with least eigenvalue at least −2. Publ. Inst. Math., Nouv. Sér., 78(92):51–63, 2005.]. E...

متن کامل

The Least Eigenvalue of Graphs

In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.

متن کامل

Distance-regular Cayley graphs with least eigenvalue -2

We classify the distance-regular Cayley graphs with least eigenvalue −2 and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain projective planes. In addition, we classify the possible connection sets for the lattice graphs and obtain some results on the structure of distance-regular C...

متن کامل

Ela Notes on Graphs with Least Eigenvalue

A new proof concerning the determinant of the adjacency matrix of the line graph of a tree is presented and an invariant for line graphs, introduced by Cvetković and Lepović, with least eigenvalue at least −2 is revisited and given a new equivalent definition [D. Cvetković and M. Lepović. Cospectral graphs with least eigenvalue at least −2. Publ. Inst. Math., Nouv. Sér., 78(92):51–63, 2005.]. E...

متن کامل

Signed line graphs with least eigenvalue -2: The star complement technique

Let G be a connected graph with least eigenvalue −2, of multiplicity k. A star complement for −2 in G is an induced subgraph H = G − X such that |X | = k and −2 is not an eigenvalue of H . In the case that G is a generalized line graph, a characterization of such subgraphs is used to decribe the eigenspace of −2. In some instances, G itself can be characterized by a star complement. If G is not...

متن کامل

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


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

ژورنال

عنوان ژورنال: Electronic Journal of Linear Algebra

سال: 2021

ISSN: ['1081-3810', '1537-9582']

DOI: https://doi.org/10.13001/ela.2021.5249