Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/11018
Title: | Maximizing the number of spanning trees in K(n)-complements of asteroidal graphs |
Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής |
Keywords: | spanning trees,complement-spanning-tree matrix,star-like graphs,maximization,interconnection networks,polynomials,circulant |
URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/11018 |
ISSN: | 0012-365X |
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