Results 271 to 280 of about 3,263,133 (311)
Some of the next articles are maybe not open access.
Graph equations for line graphs, blitact graphs and blict graphs
Journal of Discrete Mathematical Sciences and Cryptography, 2005Abstract In this paper, we solve the graph equations L(G)=B m (H), L(G) and . The equality symbol ‘=’ stands for an isomorphism between two graphs.
B. Basavanagoud, Veena N. Mathad
openaire +1 more source
Oxford lecture series in mathematics and its applications
This is a book about graph homomorphisms, intended to introduce this exciting topic to a wide audience. It attempts to bring together what the authors see as the highlights of the theory and its many applications, and could be read as a sampler of this
P. Hell, J. Nesetril
semanticscholar +1 more source
This is a book about graph homomorphisms, intended to introduce this exciting topic to a wide audience. It attempts to bring together what the authors see as the highlights of the theory and its many applications, and could be read as a sampler of this
P. Hell, J. Nesetril
semanticscholar +1 more source
Symmetric Graphs and Flag Graphs
Monatshefte f�r Mathematik, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
International Journal of Fuzzy Mathematical Archive
Hajos Fuzzy graph is a new fuzzy graph obtained by applying a binary operation, named Hajos construction, on two fuzzy graphs. The Hajos construction on two (fuzzy) graphs produces many different (fuzzy) graphs depending on the choice of vertices and edges.
K. Radha, A. Jasmine Kingsly
openaire +1 more source
Hajos Fuzzy graph is a new fuzzy graph obtained by applying a binary operation, named Hajos construction, on two fuzzy graphs. The Hajos construction on two (fuzzy) graphs produces many different (fuzzy) graphs depending on the choice of vertices and edges.
K. Radha, A. Jasmine Kingsly
openaire +1 more source
Conceptual Graphs Are Also Graphs
2014The main objective of this paper is to add one more brick in building the CG model as a knowledge representation model autonomous from logic. The CG model is not only a graphical representation of logic, it is much more: it is a declarative model encoding knowledge in a mathematical theory, namely labelled graph theory, which has efficient computable ...
Chein, Michel, Mugnier, Marie-Laure
openaire +1 more source
Distributed Graphs and Graph Transformation
Applied Categorical Structures, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2017 IEEE 15th International Conference on Software Engineering Research, Management and Applications (SERA), 2017
Knowledge graphs have been widely adopted, in large part owing to their schema-less nature. It enables knowledge graphs to grow seamlessly and allows for new relationships and entities as needed. Knowledge graph has become a powerful tool to represent knowledge in the form of a labelled directed graph and to give semantics to textual information.
Yucong Duan +5 more
openaire +1 more source
Knowledge graphs have been widely adopted, in large part owing to their schema-less nature. It enables knowledge graphs to grow seamlessly and allows for new relationships and entities as needed. Knowledge graph has become a powerful tool to represent knowledge in the form of a labelled directed graph and to give semantics to textual information.
Yucong Duan +5 more
openaire +1 more source
The Quarterly Journal of Mathematics, 1993
Several classes of finite distance spaces and the corresponding classes of graphs are considered \((l_ 1\)-space, \(h\)-embeddable, spherical, hypermetric and of negative type). The focus is on hypermetric graphs. Several characterization results for hypermetric graphs are given. In particular, connected regular hypermetric graphs of diameter \(\leq 2\)
Deza, M., Grishukhin, P.
openaire +1 more source
Several classes of finite distance spaces and the corresponding classes of graphs are considered \((l_ 1\)-space, \(h\)-embeddable, spherical, hypermetric and of negative type). The focus is on hypermetric graphs. Several characterization results for hypermetric graphs are given. In particular, connected regular hypermetric graphs of diameter \(\leq 2\)
Deza, M., Grishukhin, P.
openaire +1 more source
Henson graphs and Urysohn—Henson graphs as Cayley graphs
Functional Analysis and Its Applications, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A note on two problems in connexion with graphs
Numerische Mathematik, 1959E. Dijkstra
semanticscholar +1 more source

