{"title":"关于有符号图索引的一个基于行走的不等式的注记","authors":"Z. Stanić","doi":"10.1515/spma-2020-0120","DOIUrl":null,"url":null,"abstract":"Abstract We derive an inequality that includes the largest eigenvalue of the adjacency matrix and walks of an arbitrary length of a signed graph. We also consider certain particular cases.","PeriodicalId":43276,"journal":{"name":"Special Matrices","volume":"9 1","pages":"19 - 21"},"PeriodicalIF":0.8000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/spma-2020-0120","citationCount":"1","resultStr":"{\"title\":\"A note on a walk-based inequality for the index of a signed graph\",\"authors\":\"Z. Stanić\",\"doi\":\"10.1515/spma-2020-0120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We derive an inequality that includes the largest eigenvalue of the adjacency matrix and walks of an arbitrary length of a signed graph. We also consider certain particular cases.\",\"PeriodicalId\":43276,\"journal\":{\"name\":\"Special Matrices\",\"volume\":\"9 1\",\"pages\":\"19 - 21\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1515/spma-2020-0120\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Special Matrices\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/spma-2020-0120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Special Matrices","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/spma-2020-0120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
A note on a walk-based inequality for the index of a signed graph
Abstract We derive an inequality that includes the largest eigenvalue of the adjacency matrix and walks of an arbitrary length of a signed graph. We also consider certain particular cases.
期刊介绍：
Special Matrices publishes original articles of wide significance and originality in all areas of research involving structured matrices present in various branches of pure and applied mathematics and their noteworthy applications in physics, engineering, and other sciences. Special Matrices provides a hub for all researchers working across structured matrices to present their discoveries, and to be a forum for the discussion of the important issues in this vibrant area of matrix theory. Special Matrices brings together in one place major contributions to structured matrices and their applications. All the manuscripts are considered by originality, scientific importance and interest to a general mathematical audience. The journal also provides secure archiving by De Gruyter and the independent archiving service Portico.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
