High-order spectral characterizations of graphs

IF 0.7 3区数学 Q2 MATHEMATICS Discrete Mathematics Pub Date : 2025-02-07 DOI:10.1016/j.disc.2025.114421

Lixiang Chen , Lizhu Sun , Changjiang Bu

引用次数: 0

Abstract

The tensor spectra of the power hypergraph of a graph G is called the high-order spectra of G. In this paper, we show that all Smith graphs are determined by their high-order spectra. We give some high-order cospectral invariants of trees and use them to show that some cospectral trees constructed by the classical Schwenk method can be distinguished by their high-order spectra.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

求助全文

约1分钟内获得全文去求助

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.

期刊最新文献

Sets of vertices with extremal energy N-ary groups of panmagic permutations from the Post coset theorem Every nonsymmetric 4-class association scheme can be generated by a digraph On Steinerberger curvature and graph distance matrices On Galois LCD codes and LCPs of codes over mixed alphabets