On Gorenstein graphs
We classify all Gorenstein claw-free graphs. Moreover, we provide a new way to construct a Gorenstein graph from another one.
Gespeichert in:
| Veröffentlicht in: | Journal of algebraic combinatorics 2021-09, Vol.54 (2), p.673-688 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 688 |
|---|---|
| container_issue | 2 |
| container_start_page | 673 |
| container_title | Journal of algebraic combinatorics |
| container_volume | 54 |
| creator | Trung, Tran Nam |
| description | We classify all Gorenstein claw-free graphs. Moreover, we provide a new way to construct a Gorenstein graph from another one. |
| doi_str_mv | 10.1007/s10801-021-01051-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2580341845</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2580341845</sourcerecordid><originalsourceid>FETCH-LOGICAL-c314t-3fdd0a9a941802c61aa4c19f7a7d78b36cde481f9ca75912b81200e05c6124973</originalsourceid><addsrcrecordid>eNp9j79PwzAQhS0EEqGwMTFVYjbc-UftG1EFBalSl3a2XMcprSAJdjrw32MIEhvD6S3fe6ePsRuEOwQw9xnBAnIQ5RA0cjphFWojOCGJU1YBCc3JEp2zi5wPAEAWdcWuV-100aXY5iHu2-ku-f41X7Kzxr_lePWbE7Z5elzPn_lytXiZPyx5kKgGLpu6Bk-eFFoQYYbeq4DUGG9qY7dyFuqoLDYUvNGEYmtRAETQBRWKjJyw23G3T93HMebBHbpjastLJ7QFWXaVLpQYqZC6nFNsXJ_27z59OgT3be9Ge1fs3Y-9o1KSYykXuN3F9Df9T-sLko5Z0g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2580341845</pqid></control><display><type>article</type><title>On Gorenstein graphs</title><source>SpringerLink Journals - AutoHoldings</source><creator>Trung, Tran Nam</creator><creatorcontrib>Trung, Tran Nam</creatorcontrib><description>We classify all Gorenstein claw-free graphs. Moreover, we provide a new way to construct a Gorenstein graph from another one.</description><identifier>ISSN: 0925-9899</identifier><identifier>EISSN: 1572-9192</identifier><identifier>DOI: 10.1007/s10801-021-01051-9</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Combinatorics ; Computer Science ; Convex and Discrete Geometry ; Graphs ; Group Theory and Generalizations ; Lattices ; Mathematics ; Mathematics and Statistics ; Order ; Ordered Algebraic Structures</subject><ispartof>Journal of algebraic combinatorics, 2021-09, Vol.54 (2), p.673-688</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021</rights><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c314t-3fdd0a9a941802c61aa4c19f7a7d78b36cde481f9ca75912b81200e05c6124973</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10801-021-01051-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10801-021-01051-9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Trung, Tran Nam</creatorcontrib><title>On Gorenstein graphs</title><title>Journal of algebraic combinatorics</title><addtitle>J Algebr Comb</addtitle><description>We classify all Gorenstein claw-free graphs. Moreover, we provide a new way to construct a Gorenstein graph from another one.</description><subject>Combinatorics</subject><subject>Computer Science</subject><subject>Convex and Discrete Geometry</subject><subject>Graphs</subject><subject>Group Theory and Generalizations</subject><subject>Lattices</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Order</subject><subject>Ordered Algebraic Structures</subject><issn>0925-9899</issn><issn>1572-9192</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9j79PwzAQhS0EEqGwMTFVYjbc-UftG1EFBalSl3a2XMcprSAJdjrw32MIEhvD6S3fe6ePsRuEOwQw9xnBAnIQ5RA0cjphFWojOCGJU1YBCc3JEp2zi5wPAEAWdcWuV-100aXY5iHu2-ku-f41X7Kzxr_lePWbE7Z5elzPn_lytXiZPyx5kKgGLpu6Bk-eFFoQYYbeq4DUGG9qY7dyFuqoLDYUvNGEYmtRAETQBRWKjJyw23G3T93HMebBHbpjastLJ7QFWXaVLpQYqZC6nFNsXJ_27z59OgT3be9Ge1fs3Y-9o1KSYykXuN3F9Df9T-sLko5Z0g</recordid><startdate>20210901</startdate><enddate>20210901</enddate><creator>Trung, Tran Nam</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20210901</creationdate><title>On Gorenstein graphs</title><author>Trung, Tran Nam</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c314t-3fdd0a9a941802c61aa4c19f7a7d78b36cde481f9ca75912b81200e05c6124973</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Combinatorics</topic><topic>Computer Science</topic><topic>Convex and Discrete Geometry</topic><topic>Graphs</topic><topic>Group Theory and Generalizations</topic><topic>Lattices</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Order</topic><topic>Ordered Algebraic Structures</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Trung, Tran Nam</creatorcontrib><collection>CrossRef</collection><jtitle>Journal of algebraic combinatorics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Trung, Tran Nam</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Gorenstein graphs</atitle><jtitle>Journal of algebraic combinatorics</jtitle><stitle>J Algebr Comb</stitle><date>2021-09-01</date><risdate>2021</risdate><volume>54</volume><issue>2</issue><spage>673</spage><epage>688</epage><pages>673-688</pages><issn>0925-9899</issn><eissn>1572-9192</eissn><abstract>We classify all Gorenstein claw-free graphs. Moreover, we provide a new way to construct a Gorenstein graph from another one.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10801-021-01051-9</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0925-9899 |
| ispartof | Journal of algebraic combinatorics, 2021-09, Vol.54 (2), p.673-688 |
| issn | 0925-9899 1572-9192 |
| language | eng |
| recordid | cdi_proquest_journals_2580341845 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Combinatorics Computer Science Convex and Discrete Geometry Graphs Group Theory and Generalizations Lattices Mathematics Mathematics and Statistics Order Ordered Algebraic Structures |
| title | On Gorenstein graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T17%3A30%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20Gorenstein%20graphs&rft.jtitle=Journal%20of%20algebraic%20combinatorics&rft.au=Trung,%20Tran%20Nam&rft.date=2021-09-01&rft.volume=54&rft.issue=2&rft.spage=673&rft.epage=688&rft.pages=673-688&rft.issn=0925-9899&rft.eissn=1572-9192&rft_id=info:doi/10.1007/s10801-021-01051-9&rft_dat=%3Cproquest_cross%3E2580341845%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2580341845&rft_id=info:pmid/&rfr_iscdi=true |