{"title":"具有矩阵权重的树的距离矩阵的平方","authors":"Iswar Mahato, M. Kannan","doi":"10.1080/09728600.2023.2236172","DOIUrl":null,"url":null,"abstract":"Let $T$ be a tree on $n$ vertices whose edge weights are positive definite matrices of order $s$. The squared distance matrix of $T$, denoted by $\\Delta$, is the $ns \\times ns$ block matrix with $\\Delta_{ij}=d(i,j)^2$, where $d(i,j)$ is the sum of the weights of the edges in the unique $(i,j)$-path. In this article, we obtain a formula for the determinant of $\\Delta$ and find ${\\Delta}^{-1}$ under some conditions.","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"1 1","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2022-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Squared distance matrices of trees with matrix weights\",\"authors\":\"Iswar Mahato, M. Kannan\",\"doi\":\"10.1080/09728600.2023.2236172\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let $T$ be a tree on $n$ vertices whose edge weights are positive definite matrices of order $s$. The squared distance matrix of $T$, denoted by $\\\\Delta$, is the $ns \\\\times ns$ block matrix with $\\\\Delta_{ij}=d(i,j)^2$, where $d(i,j)$ is the sum of the weights of the edges in the unique $(i,j)$-path. In this article, we obtain a formula for the determinant of $\\\\Delta$ and find ${\\\\Delta}^{-1}$ under some conditions.\",\"PeriodicalId\":48497,\"journal\":{\"name\":\"AKCE International Journal of Graphs and Combinatorics\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AKCE International Journal of Graphs and Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1080/09728600.2023.2236172\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AKCE International Journal of Graphs and Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/09728600.2023.2236172","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Squared distance matrices of trees with matrix weights
Let $T$ be a tree on $n$ vertices whose edge weights are positive definite matrices of order $s$. The squared distance matrix of $T$, denoted by $\Delta$, is the $ns \times ns$ block matrix with $\Delta_{ij}=d(i,j)^2$, where $d(i,j)$ is the sum of the weights of the edges in the unique $(i,j)$-path. In this article, we obtain a formula for the determinant of $\Delta$ and find ${\Delta}^{-1}$ under some conditions.
期刊介绍:
AKCE International Journal of Graphs and Combinatorics is devoted to publication of standard original research papers in Combinatorial Mathematics and related areas. The fields covered by the journal include: Graphs and hypergraphs, Network theory, Combinatorial optimization, Coding theory, Block designs, Combinatorial geometry, Matroid theory, Logic, Computing, Neural networks and any related topics. Each volume will consist of three issues to be published in the months of April, August and December every year. Contribution presented to the journal can be Full-length article, Review article, Short communication and about a conference. The journal will also publish proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standard of the journal.