Results 51 to 60 of about 1,724,695 (249)

A method of ranking scientific publications according to their degree of importance

open access: yesУчёные записки Казанского университета: Серия Физико-математические науки
Scientific publications play a crucial role in the exchange of information among scientists. Due to ongoing technological progress and digitalization in all fields, the already large volume of scientific information, both in the form of publications and ...
A. M. Elizarov, I. G. Olgina
doaj   +1 more source

Research and Application of Hypernetwork Energy

open access: yesJisuanji kexue yu tansuo, 2021
Graph energy plays an important role in research of graph theory. Graph energy and many other similar variants have been applied in many other types of graphs, e.g., undirected graphs, oriented graphs, mixed graphs, and so on.
LIU Shengjiu, LI Tianrui, LIU Jia, XIE Peng
doaj   +1 more source

In silico and in vitro exploration of a tyrosinase for biocatalytic production of catechols

open access: yesFEBS Open Bio, EarlyView.
Tyrosinase from Ralstonia pseudosolanacearum is a promising biocatalyst for producing valuable catechols from monophenol substrates. This tyrosinase is uniquely suited to this due to its high monophenolase : diphenolase ratio. We combined in silico docking and in vivo kinetic characterisation of this tyrosinase with 11 industrially relevant monophenols,
James Britton   +6 more
wiley   +1 more source

Skew-spectra and skew energy of various products of graphs [PDF]

open access: yesTransactions on Combinatorics, 2015
Given a graph $G$, let $G^sigma$ be an oriented graph of $G$ with the orientation $sigma$ and skew-adjacency matrix $S(G^sigma)$. Then the spectrum of $S(G^sigma)$ consisting of all the eigenvalues of $S(G^sigma)$ is called the skew-spectrum of $G ...
Xueliang Li, Huishu Lian
doaj  

Independent Detour Transversals in 3-Deficient Digraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2013
In 1982 Laborde, Payan and Xuong [Independent sets and longest directed paths in digraphs, in: Graphs and other combinatorial topics (Prague, 1982) 173-177 (Teubner-Texte Math., 59 1983)] conjectured that every digraph has an independent detour ...
van Aardt Susan   +2 more
doaj   +1 more source

Protocol for quantifying miRNA trafficking across the endosomal membrane

open access: yesFEBS Open Bio, EarlyView.
An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh   +2 more
wiley   +1 more source

Extremal Irregular Digraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2018
A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digraph is called minimal (maximal) if the removal of any arc (addition of any new arc) results in a non-irregular digraph. It is easily seen that the minimum
Górska Joanna   +4 more
doaj   +1 more source

An Overview of Knowledge Graph Reasoning: Key Technologies and Applications

open access: yesJournal of Sensor and Actuator Networks, 2022
In recent years, with the rapid development of Internet technology and applications, the scale of Internet data has exploded, which contains a significant amount of valuable knowledge.
Yonghong Chen   +6 more
doaj   +1 more source

Blood RNA Biomarker Signatures for Early Diagnosis and Prognosis in Ischemic and Hemorrhagic Stroke: The IBIS‐CT1 Study

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To evaluate the expression of nine blood RNA biomarkers in a clinical trial based on genes previously identified in an experimental monkey model of stroke for diagnosis feasibility and prognostication. Methods IBIS‐CT1 was a prospective longitudinal study enrolling patients with ischemic stroke (IS) or intracerebral hemorrhage (ICH ...
Salomé Retailleau   +11 more
wiley   +1 more source

Eigenvalues of oriented-graph matrices [PDF]

open access: yes, 1995
We give bounds on the real and imaginary parts of the eigenvalues of an oriented-graph matrix, prove that each of the irreducible oriented-graph matrices of order n ≥ 3 has at least three distinct eigenvalues, and determine such irreducible matrices with
Jiong-Sheng Li, Li, Jiong-Sheng
core   +1 more source

Home - About - Disclaimer - Privacy