A limit characterization for the number of spanning trees of graphs
| dc.contributor.author | Nikolopoulos, S. D. | en |
| dc.contributor.author | Nomikos, C. | en |
| dc.contributor.author | Rondogiannis, P. | en |
| dc.date.accessioned | 2015-11-24T17:00:47Z | |
| dc.date.available | 2015-11-24T17:00:47Z | |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10814 | |
| dc.rights | Default Licence | - |
| dc.subject | graphs | en |
| dc.subject | spanning trees | en |
| dc.subject | combinatorial problems | en |
| dc.title | A limit characterization for the number of spanning trees of graphs | en |
| heal.abstract | In this paper we propose a limit characterization of the behaviour of classes of graphs with respect to their number of spanning trees. Let {G(n)} be a sequence of graphs G(0), G(1), G(2),... that belong to a particular class. We consider graphs of the form K-n - G(n) that result from the complete graph K-n after removing a set of edges that span G(n). We study the spanning tree behaviour of the sequence {K-n - G(n)} when n --> infinity and the number of edges of G(n) scales according to n. More specifically, we define the spanning tree indicator alpha({G(n)}), a quantity that characterizes the spanning tree behaviour of {K-n - G(n)}. We derive closed formulas for the spanning tree indicators for certain well-known classes of graphs. Finally, we demonstrate that the indicator can be used to compare the spanning tree behaviour of different classes of graphs (even when their members never happen to have the same number of edges). (C) 2004 Elsevier B.V. All rights reserved. | en |
| heal.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.identifier.primary | DOI 10.1016/j.ipl.2004.03.001 | - |
| heal.journalName | Information Processing Letters | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 2004 | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: