Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/13010
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/13010
ISSN: 0012-365X
Link: <Go to ISI>://000266654300012
http://ac.els-cdn.com/S0012365X08005037/1-s2.0-S0012365X08005037-main.pdf?_tid=156ea4688448293e706b0db8b2b23461&acdnat=1339410006_ccc83e02bc113c0462bc77f0f623c468
Publisher: Elsevier
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ

Files in This Item:
File Description SizeFormat 
Nikolopoulos-2009-Maximizing the numbe.pdf897.57 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons