Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition

Sung Sik U

Abstract


This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs $K_m+H_n$ and $K_m+K_{n,p}$, where $H_n$ is a graph with $n$ isolated vertices.

 


Keywords


spanning tree, spanning forest, join graph, enumeration

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2016.4.2.5

Refbacks



ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats