Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.dam.2019.07.013 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
Toeplitz graph,Word-representable graph,Riordan graph,Pattern | Journal | 270 |
ISSN | Citations | PageRank |
0166-218X | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gi-Sang Cheon | 1 | 52 | 18.59 |
| Jin-ha Kim | 2 | 329 | 18.78 |
| Minki Kim | 3 | 2 | 2.06 |
| Sergey Kitaev | 4 | 194 | 39.35 |