Results 71 to 80 of about 10,152,062 (308)
Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs
Journal of Chemistry, 2021 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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Graft‐versus‐host disease (GvHD) remains one of the most significant complications of hematopoietic stem cell transplantation (HSCT). Abatacept, a selective T‐cell costimulation modulator, is a relatively novel prophylactic agent, though pediatric data remain limited.
Matthijs D. Kruizinga +3 more
wiley +1 more source
On the Number of Perfect Matchings in Random Lifts [PDF]
Combinatorics, Probability and Computing, 2010 Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint) and replacing each edge by a randomly chosen perfect matching between the n-sets corresponding to the endpoints of the edge.
Catherine S. Greenhill +2 more
openaire +4 more sources
On Bond Incident Degree Indices of Fixed-Size Bicyclic Graphs with Given Matching Number
MathematicsA 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
Journal of Mathematical and Fundamental Sciences, 2020 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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose To explore caregivers' experiences and perceptions of the nutritional challenges faced by children and adolescents undergoing cancer treatment, including oral intake and the use of nutritional support. Methods This was a qualitative study based on focus groups with parents and caregivers at a Brazilian pediatric oncology hospital ...
Danyelle Apparecida Balsamão Marques +5 more
wiley +1 more source
Diversified Top-k Graph Pattern Matching [PDF]
, 2013 Graph pattern matching has been widely used in e.g., social data analysis. A number of matching algorithms have been developed that, given a graph pattern Q and a graph G, compute the set M(Q;G) of matches of Q in G.
Wang, Xin +2 more
core
Pediatric Blood &Cancer, EarlyView.ABSTRACT The medical burdens of sickle cell disease (SCD) and transfusion‐dependent β‐thalassemia (TDT) are chronic and cumulative, even in children. Yet the effects expand beyond medications and healthcare visits due to their impacts on school attendance, academic performance, and peer engagement.
Mary Ann Etling +2 more
wiley +1 more source
On the number of iterations for the matching pursuit algorithm [PDF]
2017 25th European Signal Processing Conference (EUSIPCO), 2017 Publication in the conference proceedings of EUSIPCO, Kos island, Greece ...
Fangyao Li +3 more
openaire +2 more sources
Residual Closeness, Matching Number and Chromatic Number
The Computer Journal, 2022 Abstract Residual closeness is a novel graph-based network vulnerability parameter. In this model, links are perfectly reliable and the nodes fail independently of each other. We characterize those graphs with maximum residual closeness and those connected graphs with minimum residual closeness when matching number (chromatic number ...
Yanna Wang, Bo Zhou 0007
openaire +2 more sources