{"title":"一些非同构树突的枚举","authors":"P. R. Hampiholi, Jotiba P. Kitturkar","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.18.40","DOIUrl":null,"url":null,"abstract":"A dendroid is a connected semigraph without a strong cycle. In this paper, we obtain the various results on the enumeration of the non-isomorphic dendroids containing two edges and the dendroids with three edges.","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Enumeration of some Non-Isomorphic Dendroids\",\"authors\":\"P. R. Hampiholi, Jotiba P. Kitturkar\",\"doi\":\"10.18052/WWW.SCIPRESS.COM/BMSA.18.40\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A dendroid is a connected semigraph without a strong cycle. In this paper, we obtain the various results on the enumeration of the non-isomorphic dendroids containing two edges and the dendroids with three edges.\",\"PeriodicalId\":252632,\"journal\":{\"name\":\"Bulletin of Mathematical Sciences and Applications\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of Mathematical Sciences and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.18.40\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Mathematical Sciences and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.18.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A dendroid is a connected semigraph without a strong cycle. In this paper, we obtain the various results on the enumeration of the non-isomorphic dendroids containing two edges and the dendroids with three edges.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
