DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chwa, Kyung Yong | ko |
dc.date.accessioned | 2013-02-25T19:12:14Z | - |
dc.date.available | 2013-02-25T19:12:14Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1991 | - |
dc.identifier.citation | IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, v.38, no.1, pp.128 - 130 | - |
dc.identifier.issn | 0098-4094 | - |
dc.identifier.uri | http://hdl.handle.net/10203/64586 | - |
dc.description.abstract | Schuster has proved the following interpolation theorem. If a graph G contains spanning trees having exactly m and n end-vertices, with m < n, then for every integer p, m < p < n, G contains a spanning tree having exactly p end-vertices. To extend this theorem we generalize the end-vertex by defining the k end-vertex, where the end-vertex of G is the 1-end-vertex of G. Then we prove that the number of k-end-vertices of spanning trees of a graph G has the interpolation property for every positive integer k. | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | INTERPOLATION THEOREM FOR THE NUMBER OF GENERALIZED END-VERTICES OF SPANNING-TREES | - |
dc.type | Article | - |
dc.identifier.wosid | A1991ER06400013 | - |
dc.identifier.scopusid | 2-s2.0-0025792751 | - |
dc.type.rims | ART | - |
dc.citation.volume | 38 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 128 | - |
dc.citation.endingpage | 130 | - |
dc.citation.publicationname | IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS | - |
dc.identifier.doi | 10.1109/31.101310 | - |
dc.contributor.localauthor | Chwa, Kyung Yong | - |
dc.type.journalArticle | Note | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.