Results 31 to 40 of about 8,008 (169)
Graphs with Total Domination Number Double of the Matching Number
A subset $S$ of vertices of a graph $G$ with no isolated vertex is called a total dominating set of $G$ if each vertex of $G$ has at least one neighbor in the set $S$.
Selim Bahadır
doaj +1 more source
ABSTRACT Rates of cancer among adolescents and young adults (AYA), age 15–39 years, are increasing. Consequently, radiation oncologists are treating more AYAs who have diagnoses spanning both pediatric and adult practices. Compared to pediatric and older adult patients, AYAs face a unique set of challenges.
Hesham Elhalawani +7 more
wiley +1 more source
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
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
On the nullity number of graphs
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007) 60--67] that $\eta \le n - D$, where $\eta$, n and D denote the nullity number, the order ...
Mustapha Aouchiche, Pierre Hansen
doaj +1 more source
Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs
A connected graph GV,E in which the number of edges is one more than its number of vertices is called a bicyclic graph. A perfect matching of a graph is a matching in which every vertex of the graph is incident to exactly one edge of the matching set ...
Muhammad Rizwan +3 more
doaj +1 more source
Calpain small subunit homodimerization is robust and calcium‐independent
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
On Bond Incident Degree Indices of Fixed-Size Bicyclic Graphs with Given Matching Number
A connected graph with p vertices and q edges satisfying q=p+1 is referred to as a bicyclic graph. This paper is concerned with an optimal study of the BID (bond incident degree) indices of fixed-size bicyclic graphs with a given matching number. Here, a
Akbar Ali +6 more
doaj +1 more source
Restricted Size Ramsey Number Involving Matching and Graph of Order Five
Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four.
Denny Riama Silaban +2 more
doaj +1 more source

