Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 4, No 2 (2016): Electronic Journal of Graph Theory and Applications

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

Sung Sik U (Faculty of Mathematics, Kim II Sung University, DPRK)

Article Info

Publish Date
08 Oct 2016

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. 

Copyrights © 2016




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Electronic Journal of Graph Theory and Applications (EJGTA)
Website

Abbrev

ejgta

Publisher

Indonesian Combinatorial Society

Subject

Electrical & Electronics Engineering

Description

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society ...