{"title":"弱友谊图的古怪传播","authors":"Xuanshi Jia, Xiaohong Li, M. Brunetti","doi":"10.47443/dml.2023.099","DOIUrl":null,"url":null,"abstract":"A weak-friendship graph is a connected induced subgraph of a friendship graph. The unique graphs attaining the first two smallest eccentricity spread in the class of weak-friendship graphs of given order are determined in this paper","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2023-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The eccentricity spread of weak-friendship graphs\",\"authors\":\"Xuanshi Jia, Xiaohong Li, M. Brunetti\",\"doi\":\"10.47443/dml.2023.099\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A weak-friendship graph is a connected induced subgraph of a friendship graph. The unique graphs attaining the first two smallest eccentricity spread in the class of weak-friendship graphs of given order are determined in this paper\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2023.099\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2023.099","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
A weak-friendship graph is a connected induced subgraph of a friendship graph. The unique graphs attaining the first two smallest eccentricity spread in the class of weak-friendship graphs of given order are determined in this paper