[PDF] Top 20 A comprehensive introduction to the theory of word-representable graphs

... semigroup theory since 1960, particularly as a source of examples and ...of word-representable graphs was not under- taken until the appearance in 2008 of the paper [18] by the author and ... See full document

... check graphs for being connected, nor for being non-isomorphic to each ...undirected graphs with no two graphs being isomorphic, using the program geng ...of graphs produced by geng and insist ... See full document

... k-uniform word-representation, which is returned to the ...for graphs like the cube, the prism on the triangle, Petersen graph, and G 4 (see below), the k-uniform word ... See full document

... on word-representable graphs were obtained in the literature; for example, see [1], [3], [5], [7], [9], [11], and ...is word- representable if and only if it admits a semi-transitive ... See full document

... directed word-representable graphs was in- troduced in [13] to obtain asymptotic bounds on the free spectrum of the widely-studied Perkins semigroup, which has played central role in semi- group ... See full document

... In this paper we provide an alternative, purely algebraic, proof of this result. We will define the variety of lower semilattice-ordered residuated semigroups using finitely many equations. The subclass of ... See full document

... below shows a two-dimensional representation of all 21 languages obtained from averaging the BBA and CCA distance matrices in the All21 setup, together with a k-means cluster assignment for k = 6. We note a grouping ... See full document

... Poly-constructionism (at least as construed by me) is also a prominent feature of the ethos of work in WG, rather than a defining characteristic of the theory, but unlike im­ plementationism it does in part ... See full document

... Let LE,F be the space of all bounded linear operators from E into F and BE* the unit ball of E*, the dual of E The completion of the injective tensor product of E and F is denoted by E F[r] ... See full document

... above discussion knowing whether (Ref(Res), SAT ∗ ) is representable in resolu- tion would answer this question. Atserias and Bonet [1] proved that resolution does not have the reflection property. By Proposition ... See full document

... is word-representable if and only if it is ...cylinder graphs; indeed, there are such word-representable graphs with chromatic number ...that word-representability of ... See full document

... Graph representation of text, by its natural structure, defines relationships between graph nodes. Each graph node represents a term, which can be defined in various ways including words, sentences, and n-grams. The node ... See full document

... The elaborated position on the above stages shows that we first describe the available information. Then, we make an attempt to find out possibly unknown and doubtful facts or feel uncertain about certain matters. ... See full document

... dia, corporations, and other powerful public actors guide the collective memory and knowledge by its very conventions of representing the world in still and in moving images. Three studies in this collection of papers on ... See full document

... an introduction to a basic form of the Q-tensor approach to modelling liquid crystals, which has seen increased interest in recent ...a theory. A more complete mathematical description of this ... See full document

... using the NLM-based graph over the NLM dataset. However, the NLM-based does not perform as well in the cross-testing scenario, i.e. when applied to the Acronym datasets. This may be due to a greater specificity of the ... See full document

... We first pause to recast the Halting Problem in terms of Turing machines: Is there a procedure for deciding whether a given Turing machine eventually reaches its halt state.. The same ar[r] ... See full document

... The purpose of this paper is to initiate the exploration of maximal deviations of complex random structures from their typical behavior. We introduce a model for a high-dimensional random graph process and ask analogous ... See full document

... quantum theory which reduces to the quantum harmonic oscillator in the absence of interactions and a real scalar field, but before discussing them we first introduce the Lagrangian version of the path ... See full document

... syntactic graphs perform better than logical graphs in Table ...logical graphs gave superior performance in comparison with other contexts (Sentence context window, syntactic ...logical graphs ... See full document