Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13010Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nikolopoulos, S. D. | en |
| dc.contributor.author | Palios, L. | en |
| dc.contributor.author | Papadopoulos, C. | en |
| dc.date.accessioned | 2015-11-24T17:25:14Z | - |
| dc.date.available | 2015-11-24T17:25:14Z | - |
| dc.identifier.issn | 0012-365X | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13010 | - |
| dc.rights | Default Licence | - |
| dc.subject | spanning trees | en |
| dc.subject | complement-spanning-tree matrix | en |
| dc.subject | star-like graphs | en |
| dc.subject | maximization | en |
| dc.subject | interconnection networks | en |
| dc.subject | polynomials | en |
| dc.subject | circulant | en |
| dc.title | Maximizing the number of spanning trees in K-n-complements of asteroidal graphs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1016/j.disc.2008.08.008 | - |
| heal.identifier.secondary | <Go to ISI>://000266654300012 | - |
| heal.identifier.secondary | http://ac.els-cdn.com/S0012365X08005037/1-s2.0-S0012365X08005037-main.pdf?_tid=156ea4688448293e706b0db8b2b23461&acdnat=1339410006_ccc83e02bc113c0462bc77f0f623c468 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2009 | - |
| heal.abstract | In this paper we introduce the class of graphs whose complements are asteroidal (star-like) graphs and derive closed formulas for the number of spanning trees of its members. The proposed results extend previous results for the classes of the multi-star and multi-complete/star graphs. Additionally, we prove maximization theorems that enable us to characterize the graphs whose complements are asteroidal graphs and possess a maximum number of spanning trees. (C) 2008 Elsevier B.V. All rights reserved. | en |
| heal.publisher | Elsevier | en |
| heal.journalName | Discrete Mathematics | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Nikolopoulos-2009-Maximizing the numbe.pdf | 897.57 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
