Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13255Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nikolopoulos, S. D. | en |
| dc.contributor.author | Papadopoulos, C. | en |
| dc.date.accessioned | 2015-11-24T17:26:47Z | - |
| dc.date.available | 2015-11-24T17:26:47Z | - |
| dc.identifier.issn | 1365-8050 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13255 | - |
| dc.rights | Default Licence | - |
| dc.subject | kirchhoff matrix tree theorem | en |
| dc.subject | complement spanning tree matrix | en |
| dc.subject | spanning trees | en |
| dc.subject | k-n-complements | en |
| dc.subject | multigraphs | en |
| dc.subject | chebyshev polynomials | en |
| dc.subject | formulas | en |
| dc.subject | circulant | en |
| dc.title | On the number of spanning trees of K-n(m) +/- G graphs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.secondary | <Go to ISI>://000202967200003 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2006 | - |
| heal.abstract | The K-n-complement of a graph G, denoted by K-n - G, is defined as the graph obtained from the complete graph Kn by removing a set of edges that span G; if G has n vertices, then K n - G coincides with the complement G 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) +/- 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 m n; 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 m n 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) +/- 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. | en |
| heal.publisher | Discrete Mathematics & Theoretical Computer Science | en |
| heal.journalName | Discrete Mathematics and Theoretical Computer Science | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Papadopulos-2006-On the number of spanning.pdf | 134.41 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
