Results 161 to 170 of about 2,362 (196)

Research on traffic flow prediction of progressive graph convolutional networks based on spatio-temporal self-attention mechanism. [PDF]

Sci Rep
Liu C, Kou Y, Wang S, Xie Z, Su Y.
europepmc   +1 more source

Linking multicenter electronic health records with socioeconomic data to examine receipt of standard versus premium intraocular lenses. [PDF]

AJO Int
Mohamedali A, Chaudhury AS, Rivera AS, Zhou X, Stein JD, Andrews CA, Li Y, Marwah S, Shah R, Kanwar K, Evans CT, Kho AN, Bryar PJ, French DD.   +13 more
europepmc   +1 more source

Comprehensive spatiotemporal dataset of shared bicycle operations in Xiamen China. [PDF]

Sci Data
Cai J, Wen Q, Chen T, Xie L, Yu J, Liu Y.   +5 more
europepmc   +1 more source

Symmetry Classes of Classical Stochastic Processes. [PDF]

J Stat Phys
Sá L, Ribeiro P, Prosen T, Bernard D.
europepmc   +1 more source

Assessing food procurement greenhouse gas emissions and food waste in UK fine dining.

Clean Food Syst
Zick A, Schmidt R X, Reynolds C.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

ON THE COMMUTING GRAPH OF RINGS

Journal of Algebra and Its Applications, 2011
Let R be a non-commutative ring. The commuting graph of R denoted by Γ(R), is a graph with vertex set R\Z(R) and two vertices a and b are adjacent if ab = ba. It has been shown that the diameter of Γ(R)c is less than 3. For a finite ring R we show that the diameter of Γ(R)c is one if and only if R is the non-commutative ring on 4 elements.
Omidi, G. R., Vatandoost, E.
openaire   +1 more source

A generalization of commuting graphs

Discrete Mathematics, Algorithms and Applications, 2015
Let R be a ring with the identity element 1, α be an endomorphism of R and δ be a left α-derivation. In this paper, we introduce a generalization of a commuting graph, which is denoted by ΓR(α, δ), as a directed graph with vertex set R and, for two distinct vertices x and y, there is an arc from x to y if and only if xy = α(y)x + δ(y).
Mojgan Afkhami, Zahra Barati, Seyede Nesa Hoseini, Kazem Khashyarmanesh   +3 more
openaire   +1 more source

Graph Bases and Diagram Commutativity

Graphs and Combinatorics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard H. Hammack, Paul C. Kainen
openaire   +2 more sources

Harmonious colouring of line graph of commuting and non-commuting graph of D_{2n}

Serdica Mathematical Journal, 2023
Harmonious coloring of graph \(G\) is a proper vertex coloring, where each pair of colors occurs at most on one pair of adjacent vertices. Minimum number of colors required for Harmonious coloring of \(G\) is the harmonious chromatic number, \(\chi_{H}(G)\).
Divya, R., Chithra Devi, P.
openaire   +3 more sources

The regular graph of a commutative ring

Periodica Mathematica Hungarica, 2013
The authors define the regular graph of a unitary ring \(R\) to be the simple graph whose vertices are those elements of \(R\) which are not zero divisors, and two distinct vertices \(r, s \in R\) are adjacent if and only if \(r+s\) is a zero divisor in \(R\). The main result of the paper is: Theorem 6.
Saieed Akbari, Farideh Heydari
openaire   +2 more sources