DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cheon, Gi-Sang | ko |
dc.contributor.author | Kim, Jinha | ko |
dc.contributor.author | Kim, Minki | ko |
dc.contributor.author | Kitaev, Sergey | ko |
dc.date.accessioned | 2019-12-13T07:21:54Z | - |
dc.date.available | 2019-12-13T07:21:54Z | - |
dc.date.created | 2019-12-02 | - |
dc.date.created | 2019-12-02 | - |
dc.date.issued | 2019-11 | - |
dc.identifier.citation | DISCRETE APPLIED MATHEMATICS, v.270, pp.96 - 105 | - |
dc.identifier.issn | 0166-218X | - |
dc.identifier.uri | http://hdl.handle.net/10203/268863 | - |
dc.description.abstract | Distinct letters x and y alternate in a word w if after deleting in w all letters but the copies of x and y we either obtain a word of the form xyxy ... (of even or odd length) or a word of the form yxyx ... (of even or odd length). A graph G = (V, E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if xy is an edge in E. In this paper we initiate the study of word-representable Toeplitz graphs, which are Riordan graphs of the Appell type. We prove that several general classes of Toeplitz graphs are word-representable, and we also provide a way to construct non-word-representable Toeplitz graphs. Our work not only merges the theories of Riordan matrices and word-representable graphs via the notion of a Riordan graph, but also it provides the first systematic study of word-representability of graphs defined via patterns in adjacency matrices. Moreover, our paper introduces the notion of an infinite word-representable Riordan graph and gives several general examples of such graphs. It is the first time in the literature when the word-representability of infinite graphs is discussed. (C) 2019 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER | - |
dc.title | Word-representability of Toeplitz graphs | - |
dc.type | Article | - |
dc.identifier.wosid | 000496841800008 | - |
dc.identifier.scopusid | 2-s2.0-85070197057 | - |
dc.type.rims | ART | - |
dc.citation.volume | 270 | - |
dc.citation.beginningpage | 96 | - |
dc.citation.endingpage | 105 | - |
dc.citation.publicationname | DISCRETE APPLIED MATHEMATICS | - |
dc.identifier.doi | 10.1016/j.dam.2019.07.013 | - |
dc.contributor.nonIdAuthor | Cheon, Gi-Sang | - |
dc.contributor.nonIdAuthor | Kim, Jinha | - |
dc.contributor.nonIdAuthor | Kitaev, Sergey | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Toeplitz graph | - |
dc.subject.keywordAuthor | Word-representable graph | - |
dc.subject.keywordAuthor | Riordan graph | - |
dc.subject.keywordAuthor | Pattern | - |
dc.subject.keywordPlus | PERKINS SEMIGROUP | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.