{"title":"加权图的逆谱问题","authors":"Oleksandra Pylypiva, L. Tymoshkevych","doi":"10.18523/2617-70805202226-32","DOIUrl":null,"url":null,"abstract":"The paper is devoted to inverse spectral problems for weighted graphs. We give the sharp upper bound for spectral reconstruction number of trees and unicyclic graphs.","PeriodicalId":404986,"journal":{"name":"Mohyla Mathematical Journal","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Inverse Spectral Problems for Weighted Graphs\",\"authors\":\"Oleksandra Pylypiva, L. Tymoshkevych\",\"doi\":\"10.18523/2617-70805202226-32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper is devoted to inverse spectral problems for weighted graphs. We give the sharp upper bound for spectral reconstruction number of trees and unicyclic graphs.\",\"PeriodicalId\":404986,\"journal\":{\"name\":\"Mohyla Mathematical Journal\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mohyla Mathematical Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18523/2617-70805202226-32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mohyla Mathematical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18523/2617-70805202226-32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The paper is devoted to inverse spectral problems for weighted graphs. We give the sharp upper bound for spectral reconstruction number of trees and unicyclic graphs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
