{"title":"构造具有不可约特征多项式的共谱图","authors":"Qian Yu, Yuchao Li, Fenjin Liu","doi":"10.1016/j.laa.2025.04.019","DOIUrl":null,"url":null,"abstract":"<div><div>Graph characteristic polynomial is defined as that of its adjacency matrix, whose roots are the eigenvalues of the graph. The multi-set of graph eigenvalues is called the adjacency spectrum. Two graphs are cospectral if they have the same adjacency spectrum. We study the cospectral graphs with irreducible characteristic polynomials over rational number field. And we give infinitely many pairs of rooted cospectral graphs, generalized cospectral graphs and cospectral corona graphs with irreducible characteristic polynomials.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"720 ","pages":"Pages 139-151"},"PeriodicalIF":1.0000,"publicationDate":"2025-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Constructing cospectral graphs with irreducible characteristic polynomials\",\"authors\":\"Qian Yu, Yuchao Li, Fenjin Liu\",\"doi\":\"10.1016/j.laa.2025.04.019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Graph characteristic polynomial is defined as that of its adjacency matrix, whose roots are the eigenvalues of the graph. The multi-set of graph eigenvalues is called the adjacency spectrum. Two graphs are cospectral if they have the same adjacency spectrum. We study the cospectral graphs with irreducible characteristic polynomials over rational number field. And we give infinitely many pairs of rooted cospectral graphs, generalized cospectral graphs and cospectral corona graphs with irreducible characteristic polynomials.</div></div>\",\"PeriodicalId\":18043,\"journal\":{\"name\":\"Linear Algebra and its Applications\",\"volume\":\"720 \",\"pages\":\"Pages 139-151\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-05-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Linear Algebra and its Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0024379525001752\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Linear Algebra and its Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0024379525001752","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Constructing cospectral graphs with irreducible characteristic polynomials
Graph characteristic polynomial is defined as that of its adjacency matrix, whose roots are the eigenvalues of the graph. The multi-set of graph eigenvalues is called the adjacency spectrum. Two graphs are cospectral if they have the same adjacency spectrum. We study the cospectral graphs with irreducible characteristic polynomials over rational number field. And we give infinitely many pairs of rooted cospectral graphs, generalized cospectral graphs and cospectral corona graphs with irreducible characteristic polynomials.
期刊介绍:
Linear Algebra and its Applications publishes articles that contribute new information or new insights to matrix theory and finite dimensional linear algebra in their algebraic, arithmetic, combinatorial, geometric, or numerical aspects. It also publishes articles that give significant applications of matrix theory or linear algebra to other branches of mathematics and to other sciences. Articles that provide new information or perspectives on the historical development of matrix theory and linear algebra are also welcome. Expository articles which can serve as an introduction to a subject for workers in related areas and which bring one to the frontiers of research are encouraged. Reviews of books are published occasionally as are conference reports that provide an historical record of major meetings on matrix theory and linear algebra.