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

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition Sung Sik U
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 4, No 2 (2016): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2016.4.2.5

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.