图描述的空矩阵的特征值反及相关问题

IF 0.7 4区 数学 Q2 Mathematics
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}
引用次数: 1

摘要

由图$G$描述的空心矩阵是一个实对称矩阵,其所有对角条目都等于零,并且非对角条目由$G$中的邻接控制。对于给定的图$G$,与$G$相关的矩阵的所有可能谱的确定是$G$的空心逆特征值问题。给出了路径和完全二部图的空心特征值反问题的解。对于附加的图族,给出了相关子问题的结果,如可能的有序多重性列表、特征值的最大多重性和不同特征值的最小数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.20
自引率
14.30%
发文量
45
审稿时长
6-12 weeks
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信