[PDF] Top 20 New results on word-representable graphs
Has 10000 "New results on word-representable graphs" found on our website. Below are the top 20 most common "New results on word-representable graphs".
New results on word-representable graphs
... 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 (x, y) ∈ E for each x 6= y ...of word-representable ... See full document
8
Solving computational problems in the theory of word-representable graphs
... for graphs on at most 9 ...connected graphs on 11 vertices are ...our results in Section 3 is the correction of the published result [19, 20] on the number of connected non- ... See full document
18
Word Representability of Line Graphs
... is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if x y , is in E for each x not equal to ...study representable graphs ... See full document
6
Word-representability of triangulations of grid-covered cylinder graphs
... the results of Akrobotu, Kitaev and Mas´ arov´ a [1] to the case of grid-covered cylinder graphs, which is a cyclic version of rect- angular grid graphs; see Subsection ...the graphs in ... See full document
19
Co-occurrence graphs for word sense disambiguation in the biomedical domain
... a new graph- based unsupervised technique to address this ...static graphs such as UMLS, in this work the knowledge base takes the context of the ambiguous terms into ...scalability. Results show ... See full document
22
On k-11-representable graphs
... about word-representable ...k-11- representable graph and provide a number of general results on these ...non-word-representable graphs on at most 7 ... See full document
19
Word-representability of face subdivisions of triangular grid graphs
... (fundamental) results 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 ... See full document
17
Can Syntactic and Logical Graphs help Word Sense Disambiguation?
... of word sense disambiguation (WSD) can be regarded as one of the most important tasks for natural language processing applications including semantic interpretation of texts, semantic web applications, ... See full document
7
Solving computational problems in the theory of word representable graphs
... for graphs on at most 9 ...connected graphs on 11 vertices are ...our results in Section 3 is the correction of the published result [19, 20] on the number of connected non- ... See full document
18
Using Graphs for Word Embedding with Enhanced Semantic Relations
... a word embedding algorithm with semantic ...experimental results show that the proposed embedding did not achieve the best results on analogy and classification tasks but was stable across the ... See full document
10
Semi-transitive orientations and word-representable graphs
... known results. In Section 3, we give a characterization of word-representable graphs in terms of orientations and discuss some important corollaries of this ...of graphs are ... See full document
14
Language classification from bilingual word embedding graphs
... multilingual word vectors have been evaluated with respect to intrinsic parameters such as embedding dimensionality, empirical work on another aspect appears to be lacking: the second language ...Latin word ... See full document
12
The Results on Vertex Domination in Fuzzy Graphs
... fuzzy graphs, monotone decreasing property and monotone increasing property is ...type results for these ...fuzzy graphs with the vertex domination number of them is ... See full document
20
More results on eccentric coloring in graphs
... [3], new ones will be introduced as and when found ...undirected graphs without multiple edges and self ...two graphs G 1 and G 2 , defined by Zykov [8], is denoted G 1 + G 2 and consists ... See full document
14
SOME RESULTS ON BIPOLAR FUZZY GRAPHS
... [2]M.Akram, Bipolar fuzzy graphs, Information sciences,DOI 10.1016/j.ins 2011.07.037,2011. [3] A.Nagoorgani,K.Radha, On regular fuzzy graphs, journal of physical sciences,Vol.12,33-44,2008. [4] A.Nagoorgani ... See full document
8
Further Results on Sum Cordial Graphs
... All graphs G = ( V ( G ) , E ( G )) in this paper are finite, connected and ...Labeled graphs have variety of applications in graph theory, particularly for missile guidance code, design good radar type ... See full document
7
p representable operators in Banach spaces
... 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
6
The equational theories of representable residuated semigroups
... Residuated algebras and their equational theories have been investigated on their own right and also in connection with substructural logics. The reason for the latter is that the algebraizations of substructural logics ... See full document
8
Relation Prediction for Unseen Entities Using Entity Word Graphs
... the Entity-Word graph, even Unseen-entities can explicitly be connected with other entities. Our method encodes the graph with Graph Convolu- tional Networks (GCNs) (Kipf and Welling, 2017) to learn entity ... See full document
6
Word Sense Induction & Disambiguation Using Hierarchical Random Graphs
... Another graph-based method is presented in (Dorow and Widdows, 2003). They extract only noun neighbours that appear in conjunctions or dis- junctions with the target word. Additionally, they extract second-order ... See full document
11
Related subjects