Results 51 to 60 of about 76,042 (299)
Biometric relations of freshwater fishes of the Suaza River (Huila Department, Colombia) [PDF]
The knowledge of freshwater fishes in remote Andean mountains is scarce and restricted to changes of occurrence distribution along a specific gradient.
I. Tobes +3 more
doaj +3 more sources
First confirmed breeding of the Brown Hornbill in China, documented through cooperative feeding in Shangyong Protected Area. ABSTRACT The Brown Hornbill (Anorrhinus austeni), a Near Threatened frugivore, reaches the northern edge of its distribution in southern Yunnan, China, yet breeding had not been previously documented with site‐attributed nests in
Junsong Li +8 more
wiley +1 more source
Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution
This paper studies a class of quasi-cyclic LDPC (QC-LDPC) codes, i.e., Tanner (3, 23)-regular QC-LDPC codes of code length $23p$ with $p$ being a prime and $p \equiv 1 (\mathrm {mod} 69)$ .
Qi Wang +5 more
doaj +1 more source
On Almost Well-Covered Graphs of Girth at Least 6
We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-covered can be measured by its independence gap, defined as the difference ...
Ekim, Tınaz +3 more
core +1 more source
ABSTRACT Background Skeletal muscle blood oxygen level dependent (BOLD) MRI is a technique for assessing vascular function in peripheral limbs. In patients, however, an increased frequency of atypical response patterns has been observed, warranting investigation into its underlying causes.
Jonathan Arvidsson +5 more
wiley +1 more source
A graph and its complement with specified properties III: girth and circumference
In this series, we investigate the conditions under which both a graph G and its complement G¯ possess certain specified properties. We now characterize all the graphs G such that both G and G¯ have the same girth.
Jin Akiyama, Frank Harary
doaj +1 more source
Near-colorings: non-colorable graphs and NP-completeness [PDF]
A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1
Montassier, Mickael, Ochem, Pascal
core
Abstract Purpose The purpose of this study was to determine whether there was an association between preoperative Kellgren–Lawrence (KL) grade and long‐term failure rates, reoperation free survival rates, and patient reported outcomes of patients undergoing medial meniscal posterior root repair (MMPRR).
Dan Cohen +7 more
wiley +1 more source
On the annihilator graphs of partial transformation semigroups
Let [Formula: see text] and [Formula: see text] be a partial transformation semigroup on [Formula: see text] Obviously, the empty set [Formula: see text] is a zero element of [Formula: see text] and denoted by 0.
Chollawat Pookpienlert +2 more
doaj +1 more source
On General Reduced Second Zagreb Index of Graphs
Graph-based molecular structure descriptors (often called “topological indices”) are useful for modeling the physical and chemical properties of molecules, designing pharmacologically active compounds, detecting environmentally hazardous substances, etc.
Lkhagva Buyantogtokh +2 more
doaj +1 more source

