Results 311 to 320 of about 2,125,479 (331)
Some of the next articles are maybe not open access.
Graph–Graph Similarity Network
IEEE Transactions on Neural Networks and Learning SystemsGraph learning aims to predict the label for an entire graph. Recently, graph neural network (GNN)-based approaches become an essential strand to learning low-dimensional continuous embeddings of entire graphs for graph label prediction. While GNNs explicitly aggregate the neighborhood information and implicitly capture the topological structure for ...
Han Yue, Pengyu Hong, Hongfu Liu
openaire +2 more sources
Graph Decomposition of Slim Graphs
Graphs and Combinatorics, 1999Let \(H\) be a fixed graph. An \(H\)-decomposition of an input graph \(G\) is a partition of the edge set of \(G\) such that each part forms a subgraph isomorphic to \(H\). This problem is known to be NP-complete as soon as \(H\) has a component with at least three edges. (This was conjectured by Holyer, and proved independently by \textit{D. Dor} and \
Caro, Yair, Yuster, Raphael
openaire +2 more sources
1998
Abstract We met with spanning trees of a graph in the first chapter and with spanning circuits in the second. We shall next be concerned with spanning subgraphs satisfying certain valency conditions.
John Ball, Dominic Welsh
openaire +1 more source
Abstract We met with spanning trees of a graph in the first chapter and with spanning circuits in the second. We shall next be concerned with spanning subgraphs satisfying certain valency conditions.
John Ball, Dominic Welsh
openaire +1 more source
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
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