Results 31 to 40 of about 423,962 (267)
The Thickness of the Complete Graph [PDF]
Canadian Journal of Mathematics, 1965 A graph G consists of a finite set of p points and q lines joining pairs of these points. Each line joins two distinct points and no pair of points is joined by more than one line. A subgraph of G is a graph whose points and lines are also in G. If every pair of points of a graph is joined by a line, the graph is called complete and is denoted by Kp. A
Beineke, L. W., Harary, Frank
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Type 1 plasminogen deficiency (PLGD‐1) is an ultra‐rare autosomal recessive disorder caused by variants in the PLG gene and affects approximately 1.6 individuals per million. The condition is characterized by decreased plasminogen levels and impaired function, resulting in fibrin‐rich lesions on mucous membranes throughout the body.
Charles Nakar +7 more
wiley +1 more source
The Reliability of a Class of Two-Layer Networks with Unreliable Edges
AxiomsIt is well known that networks are dynamic graphs, and the topology of a network can be described by a graph. Thus, the reliability of a network under edge failure is defined as the probability that its corresponding topological graph remains connected ...
Sun Xie, Haixing Zhao, Jun Yin
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Neurodevelopmental and neurocognitive difficulties are prevalent among individuals with sickle cell disease and warrant prompt identification and support. This Special Report provides an executive summary of standards and recommendations for surveillance, screening, and evaluation for development and cognition across the lifespan developed by ...
Alyssa M. Schlenz +12 more
wiley +1 more source
Signed Complete Graphs with Maximum Index
Discussiones Mathematicae Graph Theory, 2020 Let Γ = (G, σ) be a signed graph, where G is the underlying simple graph and σ E(G) → {−, +} is the sign function on the edges of G. The adjacency matrix of a signed graph has −1 or +1 for adjacent vertices, depending on the sign of the edges.
Akbari Saieed +3 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Pediatric cancer remains a leading cause of morbidity and mortality worldwide, particularly in low‐and middle‐income countries. Cancer treatment may impair nutritional status, alter body composition, and exacerbate cancer‐related fatigue (CRF).
Luís Carlos Lopes‐Junior +11 more
wiley +1 more source
Statistical Properties of SIS Processes with Heterogeneous Nodal Recovery Rates in Networks
Applied SciencesThe modeling and analysis of epidemic processes in networks have attracted much attention over the past few decades. A major underlying assumption is that the recovery process and infection process are homogeneous, allowing the associated theoretical ...
Dongchao Guo, Libo Jiao, Wendi Feng
doaj +1 more source
DIMENSI METRIK KETETANGGAAN LOKAL GRAF HASIL OPERASI k-COMB
Contemporary Mathematics and Applications (ConMathA), 2019 Research on the local adjacency metric dimension has not been found in all operations of the graph, one of them is comb product graph. The purpose of this research was to determine the local adjacency metric dimension of k-comb product graph and level ...
Fryda Arum Pratama +2 more
doaj +1 more source
Graph Isomorphism Completeness for Trapezoid Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2015 4 pages, 3 Postscript ...
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT We report a retrospective single‐center analysis of pediatric patients with relapsed or refractory B‐cell precursor acute lymphoblastic leukemia focusing on relapses outside of the typical locations, bone marrow, central nervous system, or testes.
Johanna Kunz +7 more
wiley +1 more source