{"title":"用单顶点扩展描述块图","authors":"L. Markenzon, C. F. E. M. Waga","doi":"10.5540/TEMA.2019.020.02.323","DOIUrl":null,"url":null,"abstract":"Block graphs has been extensively studied for many decades. In this paper we present a new characterization of the class in terms of one-vertex extensions. To this purpose, a specific representation based on the concept of boundary cliques is presented, bringing about some properties of the graph.","PeriodicalId":163536,"journal":{"name":"TEMA - Tendências em Matemática Aplicada e Computacional","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Characterizing Block Graphs in Terms of One-vertex Extensions\",\"authors\":\"L. Markenzon, C. F. E. M. Waga\",\"doi\":\"10.5540/TEMA.2019.020.02.323\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Block graphs has been extensively studied for many decades. In this paper we present a new characterization of the class in terms of one-vertex extensions. To this purpose, a specific representation based on the concept of boundary cliques is presented, bringing about some properties of the graph.\",\"PeriodicalId\":163536,\"journal\":{\"name\":\"TEMA - Tendências em Matemática Aplicada e Computacional\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"TEMA - Tendências em Matemática Aplicada e Computacional\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5540/TEMA.2019.020.02.323\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"TEMA - Tendências em Matemática Aplicada e Computacional","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5540/TEMA.2019.020.02.323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Characterizing Block Graphs in Terms of One-vertex Extensions
Block graphs has been extensively studied for many decades. In this paper we present a new characterization of the class in terms of one-vertex extensions. To this purpose, a specific representation based on the concept of boundary cliques is presented, bringing about some properties of the graph.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
