Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
<p>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.</p><p> </p>
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2016-10-01
|
| Schriftenreihe: | Electronic Journal of Graph Theory and Applications |
| Schlagworte: | |
| Online-Zugang: | http://www.ejgta.org/index.php/ejgta/article/view/70 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|