Maximizing the number of spanning trees in K(n)-complements of asteroidal graphs

Απλή σελίδα τεκμηρίου
dc.contributor.authorNikolopoulos, S. D.en
dc.contributor.authorPalios, L.en
dc.contributor.authorPapadopoulos, C.en
dc.date.accessioned2015-11-24T17:02:08Z
dc.date.available2015-11-24T17:02:08Z
dc.identifier.issn0012-365X-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/11018
dc.rightsDefault Licence-
dc.subjectspanning treesen
dc.subjectcomplement-spanning-tree matrixen
dc.subjectstar-like graphsen
dc.subjectmaximizationen
dc.subjectinterconnection networksen
dc.subjectpolynomialsen
dc.subjectcirculanten
dc.titleMaximizing the number of spanning trees in K(n)-complements of asteroidal graphsen
heal.abstractIn 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.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.identifier.primaryDOI 10.1016/j.disc.2008.08.008-
heal.journalNameDiscrete Mathematicsen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2009-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή:
Κατεβάστε

Συλλογές

Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)