Limeng Lin , Luiz Emilio Allem , Vilmar Trevisan , Wei Wang , Hao Zhang
{"title":"A family of graphs that are DGS but not DS","authors":"Limeng Lin , Luiz Emilio Allem , Vilmar Trevisan , Wei Wang , Hao Zhang","doi":"10.1016/j.laa.2025.09.009","DOIUrl":null,"url":null,"abstract":"<div><div>The spectral characterization of graphs is a central theme in spectral graph theory. A graph <em>G</em> is <em>determined by its spectrum</em> (DS) if every graph cospectral with <em>G</em> is also isomorphic to <em>G</em>. The definition is extended to the generalized spectrum, where a graph <em>G</em> is <em>determined by its generalized spectrum</em> (DGS) if any graph <em>H</em> that is cospectral with <em>G</em> and whose complement is cospectral with <span><math><mover><mrow><mi>G</mi></mrow><mrow><mo>¯</mo></mrow></mover></math></span> must be isomorphic to <em>G</em>. While it is clear that all DS graphs are also DGS, the reverse is not always true. This leads to a natural, unanswered question: Which graphs are DGS but not DS? Previous research has focused on identifying graphs that are either DS or DGS, but, to our knowledge, research on this specific problem has not attracted much attention. This paper addresses the problem by introducing an infinite family of graphs that are DGS but not DS.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"728 ","pages":"Pages 283-294"},"PeriodicalIF":1.1000,"publicationDate":"2025-09-10","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/S0024379525003751","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
The spectral characterization of graphs is a central theme in spectral graph theory. A graph G is determined by its spectrum (DS) if every graph cospectral with G is also isomorphic to G. The definition is extended to the generalized spectrum, where a graph G is determined by its generalized spectrum (DGS) if any graph H that is cospectral with G and whose complement is cospectral with must be isomorphic to G. While it is clear that all DS graphs are also DGS, the reverse is not always true. This leads to a natural, unanswered question: Which graphs are DGS but not DS? Previous research has focused on identifying graphs that are either DS or DGS, but, to our knowledge, research on this specific problem has not attracted much attention. This paper addresses the problem by introducing an infinite family of graphs that are DGS but not DS.
期刊介绍:
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.