Results 31 to 40 of about 63,549 (264)
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
Distances in orientations of graphs
Journal of Combinatorial Theory, Series B, 1978 We prove that there is a function h(k) such that every undirected graph G admits an orientation H with the following property: if an edge uv belongs to a cycle of length k in G, then uv or vu belongs to a directed cycle of length at most h(k) in H. Next, we show that every undirected bridgeless graph of radius r admits an orientation of radius at most $
Vasek Chvátal, Carsten Thomassen
openaire +1 more source
Star complementary characterization of oriented graphs whose skew spectral radius does not exceed 2 [PDF]
Notes on Number Theory and Discrete MathematicsWe employ the method of star complements to classify all oriented graphs whose skew spectrum lies within the interval [-2,2]. At the same time, we provide a structural characterisation of these graphs, showing that, with the sole exception of exactly one
Zoran Stanić
doaj +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 +2 more
doaj +1 more source
Discrete Applied Mathematics, 2002 If \(V(G)\) is the vertex set of a connected oriented graph \(D\) then for two vertices \(u,v \in V(G)\) a shortest directed \(u\)-\(v\) path is called \(u\)-\(v\) geodesic. The closed interval \(I[u,v]\) consists of \(u\) and \(v\) together with all vertices lying in a \(u\)-\(v\) geodesic or in a \(v\)-\(u\) geodesic in \(D\). For \(S \subseteq V(D)\)
Gary Chartrand +2 more
openaire +1 more source
Journal of Combinatorial Theory, Series B, 1980 AbstractLet G(V, E) be a finite, undirected graph, and let l(X) be a set function on 2V. When can the edges of G be oriented so that the indegree of every subset X is at least l(X)? A necessary and sufficient condition is given for the existence of such an orientation when l(X) is “convex”.
openaire +2 more sources
Graph Oriented Attention Networks
IEEE AccessGraph 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
Skew Randi'c matrix and skew Randi'c energy [PDF]
Transactions on Combinatorics, 2016 Let $G$ be a simple graph with an orientation $sigma$, which assigns to each edge a direction so that $G^sigma$ becomes a directed graph. $G$ is said to be the underlying graph of the directed graph $G^sigma$.
Ran Gu, Fei Huang, Xueliang Li
doaj
Research on Service Discovery Methods Based on Knowledge Graph
IEEE Access, 2020 Service discovery is one of the main goals of a service-oriented architecture, helping to discover complex applications. Knowledge graph is a cross-cutting research hotspot in the fields of computer, knowledge engineering and information science.
Li Guodong +3 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