High-ordered spectral characterization of unicyclic graphs

Abstract

In this paper we will apply the tensor and its traces to investigate the spectral characterization of unicyclic graphs. Let $G$ be a graph and $G^m$ be the $m$-th power (hypergraph) of $G$. The spectrum of $G$ is referring to its adjacency matrix, and the spectrum of $G^m$ is referring to its adjacency tensor. The graph $G$ is called determined by high-ordered spectra (DHS for short) if, whenever $H$ is a graph such that $H^m$ is cospectral with $G^m$ for all $m$, then $H$ is isomorphic to $G$. In this paper we first give formulas for the traces of the power of unicyclic graphs, and then provide some high-ordered cospectral invariants of unicyclic graphs. We prove that a class of unicyclic graphs with cospectral mates is DHS, and give two examples of infinitely many pairs of cospectral unicyclic graphs but with different high-ordered spectra.

References in corpus (9)

• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Maximizing spectral radii of uniform hypergraphs with few edges
• On some properties of nonnegative weakly irreducible tensors
• The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
• Eigenvariety of Nonnegative Symmetric Weakly Irreducible Tensors Associated with Spectral Radius and Its Application to Hypergraphs
• The spectrum of a class of uniform hypergraphs
• The cyclic index of adjacency tensor of generalized power hypergraphs
• The trace and Estrada index of uniform hypergraphs with cut vertices
• High-ordered spectral characterizations of graphs