DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, BF | - |
dc.contributor.author | Kwak, JH | - |
dc.contributor.author | Lawrencenko, S | - |
dc.date.accessioned | 2016-03-31T13:32:51Z | - |
dc.date.available | 2016-03-31T13:32:51Z | - |
dc.date.created | 2009-02-28 | - |
dc.date.issued | 2000-04 | - |
dc.identifier.issn | 0364-9024 | - |
dc.identifier.other | 2000-OAK-0000001231 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/20069 | - |
dc.description.abstract | Let Aut(G) and E(G) denote the automorphism group and the edge set of a graph G, respectively. Weinberg's Theorem states that 4 is a constant sharp upper bound on the ratio \Aut(G)\/\E(G)\ over planar (or spherical) 3-connected graphs G. We have obtained various analogues of this theorem for nonspherical graphs, introducing two Weinberg-type bounds for an arbitrary closed surface Sigma, namely: W-P(Sigma) and W-T (Sigma) (=) (def) (G) (sup) \Aut(G)\/\E(G)\, where supremum is taken over the polyhedral graphs G with respect to C for W-P(Sigma) and over the graphs G triangulating Sigma for W-T (Sigma). We have proved that Weinberg bounds are finite for any surface; in particular: W-P = W-T = 48 for the projective plane, and W-T = 240 for the torus. We have also proved that the original Weinberg bound of 4 holds over the graphs G triangulating the projective plane with at least 8 vertices and, in general, for the graphs of sufficiently large order triangulating a fixed closed surface Sigma. (C) 2000 John Wiley & Sons, Inc. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | JOHN WILEY & SONS INC | - |
dc.relation.isPartOf | JOURNAL OF GRAPH THEORY | - |
dc.subject | automorphism group | - |
dc.subject | 3-connected graph | - |
dc.subject | surface | - |
dc.subject | triangulation | - |
dc.subject | PROJECTIVE PLANE | - |
dc.subject | TRIANGULATIONS | - |
dc.title | Weinberg bounds over nonspherical graphs | - |
dc.type | Article | - |
dc.contributor.college | 수학과 | - |
dc.identifier.doi | 10.1002/(SICI)1097-0118(200004)33:4<220::AID-JGT3>3.0.CO;2-Z | - |
dc.author.google | Chen, BF | - |
dc.author.google | Kwak, JH | - |
dc.author.google | Lawrencenko, S | - |
dc.relation.volume | 33 | - |
dc.relation.issue | 4 | - |
dc.relation.startpage | 220 | - |
dc.relation.lastpage | 236 | - |
dc.contributor.id | 10069685 | - |
dc.relation.journal | JOURNAL OF GRAPH THEORY | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCI | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | JOURNAL OF GRAPH THEORY, v.33, no.4, pp.220 - 236 | - |
dc.identifier.wosid | 000086151300003 | - |
dc.date.tcdate | 2019-01-01 | - |
dc.citation.endPage | 236 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 220 | - |
dc.citation.title | JOURNAL OF GRAPH THEORY | - |
dc.citation.volume | 33 | - |
dc.contributor.affiliatedAuthor | Kwak, JH | - |
dc.identifier.scopusid | 2-s2.0-0034382947 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 2 | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | automorphism group | - |
dc.subject.keywordAuthor | 3-connected graph | - |
dc.subject.keywordAuthor | surface | - |
dc.subject.keywordAuthor | triangulation | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.