{"title":"基于组合分解的连接图生成树和森林的枚举","authors":"S. U","doi":"10.5614/ejgta.2016.4.2.5","DOIUrl":null,"url":null,"abstract":"This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs Km +Hn and Km +Kn,p, where Hn is a graph with n isolated vertices.","PeriodicalId":43771,"journal":{"name":"Electronic Journal of Graph Theory and Applications","volume":"4 1","pages":"171 - 177"},"PeriodicalIF":0.4000,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enumeration for Spanning Trees and Forests of Join Graphs Based on the Combinatorial Decomposition\",\"authors\":\"S. U\",\"doi\":\"10.5614/ejgta.2016.4.2.5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs Km +Hn and Km +Kn,p, where Hn is a graph with n isolated vertices.\",\"PeriodicalId\":43771,\"journal\":{\"name\":\"Electronic Journal of Graph Theory and Applications\",\"volume\":\"4 1\",\"pages\":\"171 - 177\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2016-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Graph Theory and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5614/ejgta.2016.4.2.5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Graph Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5614/ejgta.2016.4.2.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
Enumeration for Spanning Trees and Forests of Join Graphs Based on the Combinatorial Decomposition
This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs Km +Hn and Km +Kn,p, where Hn is a graph with n isolated vertices.
期刊介绍：
We publish research articles written in English in all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
