Results 251 to 260 of about 3,368,549 (267)

Specifying Knowledge Graph with Data Graph, Information Graph, Knowledge Graph, and Wisdom Graph

International Journal of Software Innovation, 2018
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. A knowledge graph is a graph constructed by representing each item, entity and user as nodes, and linking those nodes that interact with each other via edges.
Yucong Duan, Lixu Shao, Gongzhu Hu
openaire   +1 more source

Graphs

Chest, 2006
Two rules of good graphs are presented and explicated.
openaire   +2 more sources

Graph–Graph Similarity Network

IEEE Transactions on Neural Networks and Learning Systems
Graph 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, 1999
Let \(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

Graphs Within Graphs

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

Graph equations for line graphs, blitact graphs and blict graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2005
Abstract 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, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Cardinality of Hajós Graphs and Hajós Fuzzy Graphs on Fan Graph, Lollipop Graph, Friendship Graph, Tadpole Graph and Crown Graph

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

Conceptual Graphs Are Also Graphs

2014
The 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, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources