Results 41 to 50 of about 839,618 (278)

Directed zero-divisor graph and skew power series rings [PDF]

open access: yesTransactions on Combinatorics, 2018
‎Let $R$ be an associative ring with identity and $Z^{\ast}(R)$ be its set of non-zero zero-divisors‎. ‎Zero-divisor graphs of rings are well represented in the literature of commutative and non-commutative rings‎. ‎The directed zero-divisor graph of $R$‎
Ebrahim Hashemi   +2 more
doaj   +1 more source

Directed Knowledge Graph Embedding Using a Hybrid Architecture of Spatial and Spectral GNNs

open access: yesMathematics
Knowledge graph embedding has been identified as an effective method for node-level classification tasks in directed graphs, the objective of which is to ensure that nodes of different categories are embedded as far apart as possible in the feature space.
Guoqiang Hou   +3 more
doaj   +1 more source

Placing Arrows in Directed Graph Drawings

open access: yes, 2016
We consider the problem of placing arrow heads in directed graph drawings without them overlapping other drawn objects. This gives drawings where edge directions can be deduced unambiguously.
A Gemsa   +10 more
core   +1 more source

A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho   +7 more
wiley   +1 more source

Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model

open access: yesAlgorithms, 2020
In a previous paper we defined the black and white SAT problem which has exactly two solutions, where each variable is either true or false. We showed that black and white 2-SAT problems represent strongly connected directed graphs. We presented also the
Gábor Kusper, Csaba Biró
doaj   +1 more source

Directed triangles in directed graphs

open access: yesDiscrete Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Directed Graph Hashing

open access: yesCoRR, 2020
This paper presents several algorithms for hashing directed graphs. The algorithms given are capable of hashing entire graphs as well as assigning hash values to specific nodes in a given graph. The notion of node symmetry is made precise via computation of vertex orbits and the graph automorphism group, and nodes that are symmetrically identical are ...
openaire   +2 more sources

Enteropathogenic E. coli shows delayed attachment and host response in human jejunum organoid‐derived monolayers compared to HeLa cells

open access: yesFEBS Letters, EarlyView.
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi   +5 more
wiley   +1 more source

Quantitation of Vascular Morphology by Directed Graph Construction

open access: yesIEEE Access, 2019
The quantitation of morphology information of X-ray angiography image has an important value in the diagnosis of coronary artery disease. This paper proposes an automatic morphology estimation method by using directed graph construction for X-ray ...
Jingliang Zhao   +5 more
doaj   +1 more source

Directed path graphs [PDF]

open access: yes, 1996
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\overrightarrow P_k(D)$ of a digraph D is obtained by representing the directed paths on k vertices of D by vertices.
Broersma, Hajo, Li, Xueliang
core   +1 more source

Home - About - Disclaimer - Privacy