F. S. Dahlgren, Zachary Gershkoff, L. Hogben, S. Motlaghian, Derek Young
{"title":"图描述的空矩阵的特征值反及相关问题","authors":"F. S. Dahlgren, Zachary Gershkoff, L. Hogben, S. Motlaghian, Derek Young","doi":"10.13001/ela.2022.6941","DOIUrl":null,"url":null,"abstract":"A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible spectra of matrices associated with $G$ is the hollow inverse eigenvalue problem for $G$. Solutions to the hollow inverse eigenvalue problems for paths and complete bipartite graphs are presented. Results for related subproblems such as possible ordered multiplicity lists, maximum multiplicity of an eigenvalue, and minimum number of distinct eigenvalues are presented for additional families of graphs.","PeriodicalId":50540,"journal":{"name":"Electronic Journal of Linear Algebra","volume":" ","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2022-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Inverse eigenvalue and related problems for hollow matrices described by graphs\",\"authors\":\"F. S. Dahlgren, Zachary Gershkoff, L. Hogben, S. Motlaghian, Derek Young\",\"doi\":\"10.13001/ela.2022.6941\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible spectra of matrices associated with $G$ is the hollow inverse eigenvalue problem for $G$. Solutions to the hollow inverse eigenvalue problems for paths and complete bipartite graphs are presented. Results for related subproblems such as possible ordered multiplicity lists, maximum multiplicity of an eigenvalue, and minimum number of distinct eigenvalues are presented for additional families of graphs.\",\"PeriodicalId\":50540,\"journal\":{\"name\":\"Electronic Journal of Linear Algebra\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2022-02-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Linear Algebra\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.13001/ela.2022.6941\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Linear Algebra","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.13001/ela.2022.6941","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
Inverse eigenvalue and related problems for hollow matrices described by graphs
A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible spectra of matrices associated with $G$ is the hollow inverse eigenvalue problem for $G$. Solutions to the hollow inverse eigenvalue problems for paths and complete bipartite graphs are presented. Results for related subproblems such as possible ordered multiplicity lists, maximum multiplicity of an eigenvalue, and minimum number of distinct eigenvalues are presented for additional families of graphs.
期刊介绍:
The journal is essentially unlimited by size. Therefore, we have no restrictions on length of articles. Articles are submitted electronically. Refereeing of articles is conventional and of high standards. Posting of articles is immediate following acceptance, processing and final production approval.