Results 31 to 40 of about 1,724,695 (249)

Oriented Chromatic Number of Cartesian Products Pm □ Pn and Cm □ Pn

Discussiones Mathematicae Graph Theory, 2022
We consider oriented chromatic number of Cartesian products of two paths Pm □ Pn and of Cartesian products of paths and cycles, Cm □ Pn. We say that the oriented graph G→\vec G is colored by an oriented graph H→\vec H if there is a homomorphism from G ...
Nenca Anna
doaj   +1 more source

A Graph Rewriting Visual Language for Database Programming [PDF]

, 1997
Textual database programming languages are computationally complete, but have the disadvantage of giving the user a non-intuitive view of the database information that is being manipulated.
Rodgers, Peter, Rodgers, Peter J.H., King, P.J.H., Rodgers, P.J.   +3 more
core   +1 more source

Every 8-Traceable Oriented Graph Is Traceable

Discussiones Mathematicae Graph Theory, 2017
A digraph of order n is k-traceable if n ≥ k and each of its induced subdigraphs of order k is traceable. It is known that if 2 ≤ k ≤ 6, every k-traceable oriented graph is traceable but for k = 7 and for each k ≥ 9, there exist k-traceable oriented ...
Aardt Susan A. van
doaj   +1 more source

The oriented chromatic number of edge-amalgamation of cycle graph

Indonesian Journal of Combinatorics, 2019
An oriented k − coloring of an oriented graph G⃗ is a partition of V(G⃗) into k color classes such that no two adjacent vertices belong to the same color class, and all the arcs linking the two color classes have the same direction.
Dina Eka Nurvazly, Jona Martinus Manulang, Kiki A. Sugeng   +2 more
doaj   +1 more source

GRAph Parallel Actor Language: A Programming Language for Parallel Graph Algorithms [PDF]

, 2013
We introduce a domain-specific language, GRAph Parallel Actor Language, that enables parallel graph algorithms to be written in a natural, high-level form.
DeLorimier, Michael John
core   +1 more source

Hierarchical models for service-oriented systems [PDF]

, 2011
We present our approach to the denotation and representation of hierarchical graphs: a suitable algebra of hierarchical graphs and two domains of interpretations.
Gadducci, Fabio, Lluch-Lafuente, Alberto, Roberto Bruni, MONTANARI, UGO GIOVANNI ERASMO, Ugo Montanari, Andrea Corradini, Bruni, Roberto, Corradini, Andrea, Alberto Lluch Lafuente, LLUCH LAFUENTE A, Fabio Gadducci, Montanari, Ugo   +11 more
core   +1 more source

Modeling and Reasoning over Distributed Systems using Aspect-Oriented Graph Grammars [PDF]

Electronic Proceedings in Theoretical Computer Science, 2010
Aspect-orientation is a relatively new paradigm that introduces abstractions to modularize the implementation of system-wide policies. It is based on a composition operation, called aspect weaving, that implicitly modifies a base system by performing ...
Rodrigo Machado, Reiko Heckel, Leila Ribeiro   +2 more
doaj   +1 more source

Acyclic, Star and Oriented Colourings of Graph Subdivisions [PDF]

Discrete Mathematics & Theoretical Computer Science, 2005
Let G be a graph with chromatic number χ(G). A vertex colouring of G is acyclic if each bichromatic subgraph is a forest. A star colouring of G is an acyclic colouring in which each bichromatic subgraph is a star forest. Let χ a (G) and χ s (G)
David R. Wood
doaj   +2 more sources

Graph Oriented Attention Networks

IEEE Access
Graph Attention Networks (GAT) is a type of neural network architecture designed to effectively model and process data represented as graphs. GATs leverage the concept of attention mechanisms to learn the importance of different nodes in a graph when ...
Ouardi Amine, Mohammed Mestari
doaj   +1 more source

Ideal Graph of a Graph [PDF]

, 2011
In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core   +1 more source