{"title":"树木偏心矩阵能量的最小值","authors":"Iswar Mahato, M. Rajesh Kannan","doi":"10.1080/03081087.2024.2314207","DOIUrl":null,"url":null,"abstract":"The eccentricity matrix of a connected graph G, denoted by E(G), is constructed from the distance matrix of G by keeping only the largest nonzero elements in each row and each column and setting th...","PeriodicalId":49905,"journal":{"name":"Linear & Multilinear Algebra","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimizers for the energy of eccentricity matrices of trees\",\"authors\":\"Iswar Mahato, M. Rajesh Kannan\",\"doi\":\"10.1080/03081087.2024.2314207\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The eccentricity matrix of a connected graph G, denoted by E(G), is constructed from the distance matrix of G by keeping only the largest nonzero elements in each row and each column and setting th...\",\"PeriodicalId\":49905,\"journal\":{\"name\":\"Linear & Multilinear Algebra\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-02-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Linear & Multilinear Algebra\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1080/03081087.2024.2314207\",\"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":"Linear & Multilinear Algebra","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/03081087.2024.2314207","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
连通图 G 的偏心矩阵（用 E(G) 表示）由 G 的距离矩阵构造而成，方法是只保留每行和每列中最大的非零元素，并将其设置为 "0"。
Minimizers for the energy of eccentricity matrices of trees
The eccentricity matrix of a connected graph G, denoted by E(G), is constructed from the distance matrix of G by keeping only the largest nonzero elements in each row and each column and setting th...
期刊介绍：
Linear and Multilinear Algebra publishes high-quality original research papers that advance the study of linear and multilinear algebra, or that include novel applications of linear and multilinear algebra to other branches of mathematics and science. Linear and Multilinear Algebra also publishes research problems, survey articles and book reviews of interest to researchers in linear and multilinear algebra. Appropriate areas include, but are not limited to:
spaces over fields or rings
tensor algebras
nonnegative matrices
inequalities in linear algebra
combinatorial matrix theory
numerical linear algebra
representation theory
Lie theory
invariant theory and
operator theory
The audience for Linear and Multilinear Algebra includes both industrial and academic mathematicians.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
