Results 241 to 250 of about 63,549 (264)
Some of the next articles are maybe not open access.
Journal of Graph Theory, 2001
The orientation distance between two orientations \(D\) and \(D'\) of a graph \(G\) is the minimum number of edges of \(G\) whose orientation needs to be reversed to transform \(D\) into an orientation isomorphic to \(D'\). The orientation distance graph with respect to \(G\) is a graph whose vertex set is a certain set of such orientations and in ...
Gary Chartrand +3 more
openaire +2 more sources
The orientation distance between two orientations \(D\) and \(D'\) of a graph \(G\) is the minimum number of edges of \(G\) whose orientation needs to be reversed to transform \(D\) into an orientation isomorphic to \(D'\). The orientation distance graph with respect to \(G\) is a graph whose vertex set is a certain set of such orientations and in ...
Gary Chartrand +3 more
openaire +2 more sources
Graph Matching in Graph-Oriented Databases
2021Modern graph database management systems use graph structures for semantic queries with nodes, edges, and properties to connect to and store information. Due to their schema-less nature, inappropriate data migration and manipulation can lead to severe data loss during the data query process.
Soumaya Boukettaya +2 more
openaire +1 more source
The Dichromate and Orientations of a Graph
Canadian Journal of Mathematics, 1977Internal and external activities are defined for any orientation of a graph relative to a fixed labelling of its edges. It is shown that the number of such orientations of having internal activity r and external activity s is 2r+sXrs where Xrs is the coefficient of xrys in the dichromate It follows that the number of orientations of in which the ...
openaire +2 more sources
On the number of Eulerian orientations of a graph
Algorithmica, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Milena Mihail, Peter Winkler 0001
openaire +3 more sources
Arc signed graphs of oriented graphs.
Ars Comb., 2002The paper generalizes the notion of line graphs for directed graphs by imposing \(+\) and \(-\) signs on edges indicating whether the adjacent edges are directed consecutively or not. The class of digraphs obtained in this way is then characterized by a Krausz-type condition (partition into complete subgraphs) and also by an infinite set of forbidden ...
openaire +1 more source
IHG4MR: Interest-oriented heterogeneous graph for multirelational recommendation
Expert Systems With Applications, 2023Junhao Wen
exaly
Design-Oriented product fault knowledge graph with frequency weight based on maintenance text
Advanced Engineering Informatics, 2023Junfeng Wang
exaly
Skew-rank of an oriented graph and independence number of its underlying graph
Journal of Combinatorial Optimization, 2019Xueliang Li, Li Xueliang
exaly
Architecting and implementing distributed Web applications using the graph-oriented approach
Software - Practice and Experience, 2003Jiannong Cao, Alvin T S Chan
exaly

