2 research outputs found

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

    No full text

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

    No full text
    This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs Km+HnK_m+H_n and Km+Kn,pK_m+K_{n,p}, where HnH_n is a graph with nn isolated vertices. </p
    corecore