Publications
Detailed Information
The h-vector of coned graphs
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kook, Woong | - |
dc.date.accessioned | 2023-07-14T04:31:34Z | - |
dc.date.available | 2023-07-14T04:31:34Z | - |
dc.date.created | 2023-07-11 | - |
dc.date.issued | 2011-04 | - |
dc.identifier.citation | Applied Mathematics Letters, Vol.24 No.4, pp.528-532 | - |
dc.identifier.issn | 0893-9659 | - |
dc.identifier.uri | https://hdl.handle.net/10371/195180 | - |
dc.description.abstract | The coned graph Ĝ on a finite graph G is obtained by joining each vertex of G to a new vertex p with a simple edge. In this work we show a combinatorial interpretation of each term in the h-vector of Ĝ in terms of partially edge-rooted forests in the base graph G. In particular, our interpretation does not require edge ordering. For an application, we will derive an exponential generating function for the sequence of h-polynomials for the complete graphs. We will also give a new proof for the number of spanning trees of the wheels. © 2010 Elsevier Ltd. All rights reserved. | - |
dc.language | 영어 | - |
dc.publisher | Pergamon Press Ltd. | - |
dc.title | The h-vector of coned graphs | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.aml.2010.11.007 | - |
dc.citation.journaltitle | Applied Mathematics Letters | - |
dc.identifier.scopusid | 2-s2.0-78650510442 | - |
dc.citation.endpage | 532 | - |
dc.citation.number | 4 | - |
dc.citation.startpage | 528 | - |
dc.citation.volume | 24 | - |
dc.description.isOpenAccess | Y | - |
dc.contributor.affiliatedAuthor | Kook, Woong | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.subject.keywordAuthor | Coned graphs | - |
dc.subject.keywordAuthor | H-vector | - |
dc.subject.keywordAuthor | Lucas numbers | - |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.