Open Access System for Information Sharing

Login Library

 

Article
Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorChoe, YoungBin-
dc.contributor.authornull-
dc.date.accessioned2016-04-01T08:59:01Z-
dc.date.available2016-04-01T08:59:01Z-
dc.date.issued2008-01-
dc.identifier.citationDISCRETE MATHEMATICS-
dc.identifier.citationv.308-
dc.identifier.citationno.24-
dc.identifier.citationpp.5944-5953-
dc.identifier.issn0012-365X-
dc.identifier.other2009-OAK-0000011280-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/29195-
dc.description.abstractRayleigh monotonicity in Physics has a combinatorial interpretation. In this paper we give a combinatorial proof of the Rayleigh formula using the Jacobi Identity and the all-minors matrix tree Theorem. Motivated by the fact that the edge set of each spanning tree of G is a basis of the graphic matroid induced by G, we define the Rayleigh monotonicity of the generating polynomial for the set of bases of a matroid and suggest a few related problems. (C) 2007 Elsevier B.V. All rights reserved.-
dc.description.statementofresponsibilityX-
dc.publisher.-
dc.subjectGraph-
dc.subjectMatroid-
dc.subjectGenerating polynomial-
dc.subjectRayleigh monotonicity-
dc.subjectHALF-PLANE PROPERTY-
dc.subjectPOLYNOMIALS-
dc.subjectTHEOREMS-
dc.titleA combinatorial proof of the Rayleigh formula for graphs-
dc.typeArticle-
dc.identifier.doi10.1016/J.DISC.2007.-
dc.author.googleChoe, YoungBin-
dc.relation.volume308-
dc.relation.issue24-
dc.relation.startpage5944-
dc.relation.lastpage5953-
dc.publisher.locationNE-
dc.relation.journalDISCRETE MATHEMATICS-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCI-
dc.collections.nameJournal Papers-
dc.type.docTypeArticle-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Views & Downloads

Browse