
doi: 10.46298/dmtcs.352
A \emphk-queue layout of a graph G consists of a linear order σ of V(G), and a partition of E(G) into k sets, each of which contains no two edges that are nested in σ . This paper studies queue layouts of graph products and powers
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm], graph, hamming graph, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Hamming graph, QA1-939, d-dimensional grid graph, queue layout, cartesian product, d-dimensional toroidal grid graph, Mathematics
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm], graph, hamming graph, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Hamming graph, QA1-939, d-dimensional grid graph, queue layout, cartesian product, d-dimensional toroidal grid graph, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 11 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
