On the number of spanning trees of K_n^m #x00B1 G graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2006

On the number of spanning trees of K_n^m #x00B1 G graphs

Abstract

The K_n-complement of a graph G, denoted by K_n-G, is defined as the graph obtained from the complete graph K_n by removing a set of edges that span G; if G has n vertices, then K_n-G coincides with the complement øverlineG of the graph G. In this paper we extend the previous notion and derive determinant based formulas for the number of spanning trees of graphs of the form K_n^m #x00b1 G, where K_n^m is the complete multigraph on n vertices with exactly m edges joining every pair of vertices and G is a multigraph spanned by a set of edges of K_n^m; the graph K_n^m + G (resp. K_n^m - G) is obtained from K_n^m by adding (resp. removing) the edges of G. Moreover, we derive determinant based formulas for graphs that result from K_n^m by adding and removing edges of multigraphs spanned by sets of edges of the graph K_n^m. We also prove closed formulas for the number of spanning tree of graphs of the form K_n^m #x00b1 G, where G is (i) a complete multipartite graph, and (ii) a multi-star graph. Our results generalize previous results and extend the family of graphs admitting formulas for the number of their spanning trees.
Fichier principal
Vignette du fichier
dm080114.pdf (141.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00961111 , version 1 (19-03-2014)

Identifiers

Cite

Stavros D. Nikolopoulos, Charis Papadopoulos. On the number of spanning trees of K_n^m #x00B1 G graphs. Discrete Mathematics and Theoretical Computer Science, 2006, Vol. 8, pp.235-248. ⟨10.46298/dmtcs.364⟩. ⟨hal-00961111⟩

Collections

TDS-MACS
116 View
1629 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More