Results 81 to 90 of about 10,152,062 (308)
Consider a unicyclic graph G with edge set E(G). Let f be a real-valued symmetric function defined on the Cartesian square of the set of all distinct elements of G’s degree sequence. A graphical edge-weight-function index of G is defined as If(G)=∑xy∈E(G)
Akbar Ali +3 more
doaj +1 more source
Ramsey Number of a Connected Triangle Matching [PDF]
AbstractWe determine the 2‐color Ramsey number of a connected triangle matching that is any connected graph containing n vertex disjoint triangles. We obtain that , somewhat larger than in the classical result of Burr, Erdős, and Spencer for a triangle matching, . The motivation is to determine the Ramsey number of the square of a cycle .
Sárközy, Gábor, Gyárfás, András
openaire +5 more sources
ABSTRACT Background Chronic micro‐inflammation in patients with end‐stage renal disease (ESRD) is a significant driver of cardiovascular complications and diminished quality of life. While standard hemodialysis (SHD) effectively manages small‐molecule clearance, its ability to remove medium‐to‐large uremic toxins—the primary catalysts of systemic ...
Hongwei Zuo +5 more
wiley +1 more source
The number of perfect matchings in a brick
A 3-connected graph is a brick if the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of the matching decomposition procedure of Kotzig, and Lovasz and Plummer.
Fuliang Lu, Huali Pan
openaire +3 more sources
Ultra-high throughput string matching for deep packet inspection [PDF]
Deep Packet Inspection (DPI) involves searching a packet's header and payload against thousands of rules to detect possible attacks. The increase in Internet usage and growing number of attacks which must be searched for has meant hardware acceleration ...
Wang, Xiaojun +3 more
core +3 more sources
Arithmetic mismatch negativity and numerical magnitude processing in number matching
Background This study examined the relationship of the arithmetic mismatch negativity (AMN) and the semantic evaluation of numerical magnitude. The first question was whether the AMN was sensitive to the incongruity in numerical information per se, or ...
Szücs Dénes, Hsu Yi-Fang
doaj +1 more source
ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito +7 more
wiley +1 more source
Organoids in pediatric cancer research
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
The Size of a Hypergraph and its Matching Number [PDF]
More than forty years ago, Erdős conjectured that for any $t \leq \frac{n}{k}$, every k-uniform hypergraph on n vertices without t disjoint edges has at most max${\binom{kt-1}{k}, \binom{n}{k}-\binom{n-t+1}{k}\}$ edges. Although this appears to be a basic instance of the hypergraph Turán problem (with a t-edge matching as the excluded hypergraph ...
Hao Huang 0005 +2 more
openaire +3 more sources
Diversity and complexity in neural organoids
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source

