High-ordered spectral characterization of unicyclic graphs

DOI10.7151/DMGT.2489arXiv2208.13204MaRDI QIDQ6409050FDOQ6409050

Authors: Yizheng Fan, Hongxia Yang, Jian Zheng 

Publication date: 28 August 2022

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.

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Hypergraphs (05C65) Solving polynomial systems; resultants (13P15) Special varieties (14M99)

This page was built for publication: High-ordered spectral characterization of unicyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409050)