Results 21 to 30 of about 839,618 (278)
On total directed graphs of non-commutative rings
AKCE International Journal of Graphs and Combinatorics, 2017 For a non-commutative ring , the left total directed graph of is a directed graph with vertex set as and for the vertices and , is adjacent to if and only if there is a non-zero which is different from and , such that is a left zero-divisor of .
Kukil Kalpa Rajkhowa, Helen K. Saikia
doaj +1 more source
Directed triangles in directed graphs
Discrete Mathematics, 1992 The authors show that if each vertex of an oriented graph \(G_ n\) has indegree and outdegree at least \(n/t\), where \(t=2.867\dots,\) then \(G_ n\) contains an oriented 3-cycle.
Maurits de Graaf +2 more
openaire +2 more sources
CoRR, 2020 The lack of anisotropic kernels in graph neural networks (GNNs) strongly limits their expressiveness, contributing to well-known issues such as over-smoothing. To overcome this limitation, we propose the first globally consistent anisotropic kernels for GNNs, allowing for graph convolutions that are defined according to topologicaly-derived directional
Beaini D. +5 more
openaire +4 more sources
Directed Representative Graph Modeling of MEP Systems Using BIM Data
Buildings, 2022 Mechanical, electrical, and plumbing (MEP) systems are crucial to a building, which directly affect the building safety, energy saving, and operational efficiency.
Junjun Han +5 more
doaj +1 more source
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs [PDF]
, 2010 We develop two different methods to achieve subexponential time parameterized algorithms for problems on sparse directed graphs. We exemplify our approaches with two well studied problems.
Dorn, Frederic +4 more
core +5 more sources
Asteroidal Quadruples in non Rooted Path Graphs
Discussiones Mathematicae Graph Theory, 2015 A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs.
Gutierrez Marisa +2 more
doaj +1 more source
Incidence Matrices of Directed Graphs of Groups and their up-down Pregroups
Sultan Qaboos University Journal for Science, 2017 The aim of this work is to give a definition of the incidence matrices of the directed graph of groups, construct an up-down pregroup of the incidence matrices of the directed graph of groups and then give an algorithm for the up-down pregroup of the ...
Wadhah S. Jassim
doaj +1 more source
On Lossy Compression of Directed Graphs [PDF]
IEEE Transactions on Information Theory, 2022 Accepted for publication in IEEE Transactions on Information ...
Ronit Bustin, Ofer Shayevitz
openaire +2 more sources
Extrema property of the k-ranking of directed paths and cycles
AKCE International Journal of Graphs and Combinatorics, 2016 A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between.
Breeanne Baker Swart +3 more
doaj +1 more source
Design and Implementation of Solution Algorithm for Foreign Key Conflict Based on Directed Graph [PDF]
Jisuanji gongcheng, 2021 As one of the important constraints in relational databases,foreign keys play an important role in constraining the order of operations of the database.However,in some cases,users cannot know the order of operations,causing foreign key conflicts.To solve
WANG Zhiduo, JIANG Bo, MIAO Rui, ZHAO Hui
doaj +1 more source