Results 281 to 290 of about 926,750 (319)
Some of the next articles are maybe not open access.
An algebra of graphs and graph rewriting
2005In this paper we propose an axiomatization of ‘partially abstract graphs’, i.e., of suitable classes of monomorphisms in a category of graphs, which may be interpreted as graphs having both a concrete part and an abstract part (defined up to isomorphism). Morphisms between pa-graphs are pushout squares.
CORRADINI, ANDREA +1 more
openaire +1 more source
GRAPHED: A Graph Description Diagram for Graph Databases
2018Within recent years, graph database systems have become very popular and deployed mainly in situations where the relationship between data is significant, such as in social networks. Although they do not require a particular schema design, a data model contributes to their consistency.
Gustavo Cordeiro Galvão Van Erven +3 more
openaire +1 more source
SIAM Journal on Discrete Mathematics, 1995
Summary: A vertex (edge) coloring \(\phi:V\rightarrow \{1,2,\ldots,t\}\) (\(\phi':E\rightarrow \{1,2,\ldots, t\})\) of a graph \(G=(V,E)\) is a vertex (edge) \(t\)-ranking if, for any two vertices (edges) of the same color, every path between them contains a vertex (edge) of larger color. The vertex ranking number \(\chi_{r}(G)\) (edge ranking number \(
Hans L. Bodlaender +6 more
openaire +3 more sources
Summary: A vertex (edge) coloring \(\phi:V\rightarrow \{1,2,\ldots,t\}\) (\(\phi':E\rightarrow \{1,2,\ldots, t\})\) of a graph \(G=(V,E)\) is a vertex (edge) \(t\)-ranking if, for any two vertices (edges) of the same color, every path between them contains a vertex (edge) of larger color. The vertex ranking number \(\chi_{r}(G)\) (edge ranking number \(
Hans L. Bodlaender +6 more
openaire +3 more sources
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 blict graph and blitact graph of a graph
Journal of Discrete Mathematical Sciences and Cryptography, 2001Abstract In this paper, we introduce the concepts of the blict graph and blitact graph of a graph. We obtain some properties of these graphs. We present characterizations of graphs whose blict graphs and blitact graphs are planar, outerplanar, maximal outerplanar and minimally nonouterplanar.
V. R. Kulli, M. S. Biradar
openaire +1 more source
On the hamiltonian path graph of a graph
Journal of Graph Theory, 1987AbstractThe hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and v are adjacent if and only if F contains a hamiltonian u − v path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian graphs isomorphic to their hamiltonian path ...
openaire +2 more sources
ACM Transactions on Algorithms, 2009
In this article we study graphs with inductive neighborhood properties. Let P be a graph property, a graph G = ( V, E ) with n vertices is said to have an inductive neighborhood property with respect to P if there is an ...
Yuli Ye, Allan Borodin
openaire +1 more source
In this article we study graphs with inductive neighborhood properties. Let P be a graph property, a graph G = ( V, E ) with n vertices is said to have an inductive neighborhood property with respect to P if there is an ...
Yuli Ye, Allan Borodin
openaire +1 more source