Enumeration for Spanning Trees and Forests of Join Graphs Based on the Combinatorial Decomposition

IF 0.4 Q4 MATHEMATICS

Electronic Journal of Graph Theory and Applications Pub Date : 2016-01-01 DOI:10.5614/ejgta.2016.4.2.5

S. U

引用次数: 0

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.

查看原文本刊更多论文

基于组合分解的连接图生成树和森林的枚举

本文讨论了标记连接图Km +Hn和Km +Kn,p的有根生成树和有根生成林的枚举问题，其中Hn是一个有n个孤立顶点的图。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Electronic Journal of Graph Theory and Applications MATHEMATICS-

CiteScore

1.20

自引率

28.60%

发文量

审稿时长

52 weeks

期刊介绍： 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.