Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/12485Full 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:21:36Z | - |
| dc.date.available | 2015-11-24T17:21:36Z | - |
| dc.identifier.issn | 0911-0119 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/12485 | - |
| dc.rights | Default Licence | - |
| dc.subject | spanning trees | en |
| dc.subject | complement spanning-tree matrix theorem | en |
| dc.subject | trees | en |
| dc.subject | quasi-threshold graphs | en |
| dc.subject | combinatorial problems | en |
| dc.subject | networks | en |
| dc.title | The number of spanning trees in K-n-Complements of quasi-threshold graphs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1007/s00373-004-0568-x | - |
| heal.identifier.secondary | <Go to ISI>://000224535500008 | - |
| heal.identifier.secondary | http://www.springerlink.com/content/4amf1kdbjv6gxp7y/fulltext.pdf | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2004 | - |
| heal.abstract | In this paper we examine the classes of graphs whose K-n-complements are trees or quasi-threshold graphs and derive formulas for their number of spanning trees; for a subgraph H of K-n, the K-n-complement of H is the graph K-n-H which is obtained from K-n by removing the edges of H. Our proofs are based on the complement spanning-tree matrix theorem, which expresses the number of spanning trees of a graph as a function of the determinant of a matrix that can be easily constructed from the adjacency relation of the graph. Our results generalize previous results and extend the family of graphs of the form K-n-H admitting formulas for the number of their spanning trees. | en |
| heal.publisher | Springer Verlag (Germany) | en |
| heal.journalName | Graphs and Combinatorics | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Nikolopoulos-2004-The number of spanni.pdf | 372.8 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
