Results 61 to 70 of about 732,396 (308)

Consensus Standards and Recommendations for Developmental and Cognitive Surveillance, Screening, and Evaluation in Sickle Cell Disease: Executive Summary From the National Alliance of Sickle Cell Centers Neurocognitive Workgroup

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, Donna Murdaugh, Andrew M. Heitzer, Jennifer N. Longoria, Wendy Santos‐Modesitt, Arianna Martin, Judy Cavazos, Jeff Schatz, Catherine R. Hoyt, Alison King, Eboni I. Lance, Steven Hardy, Marsha Treadwell   +12 more
wiley   +1 more source

Computing Metric Dimension of Power of Total Graph

IEEE Access, 2021
For a connected graph $\mathcal {G}$ , the distance $d(u, v)$ between any two vertices $u$ , $v~\in ~\mathcal {V(G)}$ is defined as; $d(u,v)=\min _{\mathcal {P}_{u,v}}\{\text {length of}~\mathcal {P}_{uv}\}$ i.e the minimum length of path ...
Sehar Nawaz, Murtaza Ali, Mushtaq Ahmad Khan, Sahib Khan   +3 more
doaj   +1 more source

Steiner radial number resulting from various graph operations

Electronic Journal of Graph Theory and Applications
The Steiner n-radial graph of a graph G on p vertices, denoted by SRn(G), has the vertex set as in G and any n(2 ≤ n ≤ p) vertices are mutually adjacent in SRn(G) if and only if they are n-radial in G.
R. Gurusamy, R. Lakshmanan, R. Ratha Jeyalakshmi, S. Arockiaraj   +3 more
doaj   +1 more source

Phase Angle as an Early Functional Biomarker of Cancer‐Related Fatigue in Pediatric Oncology: A Prospective Longitudinal Study

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, Luiz Claudio Barreto Silva Neto, Fabiano Kenji Haraguchi, Letícia Batista de Azevedo, Marcelo Brenner Nascimento Carlini, Raphael Manhães Pessanha, Mariana Rabello Laignier, Wesley Rocha Grippa, Tania Mara Lopes Bitti Bortolini, Gláucia Zouain‐Figueiredo, Regina Aparecida Garcia de Lima, Liliana Vasquez   +11 more
wiley   +1 more source

Layouts of Graph Subdivisions [PDF]

, 2004
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering. A k-track layout of a graph consists of
David R. Wood, Dujmović, Vida, Wood, David R., Vida Dujmović   +3 more
core   +1 more source

Algorithm for Constructing Total Graph of Commutative Ring

JTAM (Jurnal Teori dan Aplikasi Matematika)
Let R be a commutative ring. The total graph of R, denoted by TΓ(R) is a graph whose vertices are all elements of the ring R and every i,j∈R with i≠j, then i and j vertices are connected by edges if and only if i+j∈Z(R), where Z(R) is the set of zero ...
Rima Meinawati, Vika Yugi Kurniawan, Nughthoh Arfawi Kurdhi   +2 more
doaj   +1 more source

Total Product and Total Edge Product Cordial Labelings of Dragonfly Graph Dgn

Journal of Mathematics, 2022
In this paper, we study the total product and total edge product cordial labeling for dragonfly graph Dgn. We also define generalized dragonfly graph and find product cordial and total product cordial labeling for this family of graphs.
N. Inayah, A. Erfanian, M. Korivand
doaj   +1 more source

A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024

Therapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho, Karim M. Soliman, Wisit Cheungpasitporn, Wannasit Wathanavasin, Ahmed Daoud, Ahmed I. Kamal, Balázs Szamosfalvi, Tibor Fülöp   +7 more
wiley   +1 more source

On the total domination number of total graphs

Discussiones Mathematicae Graph Theory
Summary: Let \(G\) be a graph with no isolated vertex. A set \(D\subseteq V(G)\) is a total dominating set of \(G\) if every vertex of \(G\) is adjacent to at least one vertex in \(D\). The total domination number of \(G\), denoted by \(\gamma_t(G)\), is the minimum cardinality among all total dominating sets of \(G\).
Cabrera Martínez, Abel, Sánchez, José Luis, Cabrera-Martínez, Abel, Sánchez, José Luis, Sigarreta Almira, José María   +4 more
openaire   +4 more sources

On total covers of graphs

Discrete Mathematics, 1992
A total cover of a graph \(G\) is a subset of \(V(G)\cup E(G)\) which covers all elements of \(V(G)\cup E(G)\). The total covering number \(\alpha_ 2(G)\) of a graph \(G\) is the minimum cardinality of a total cover in \(G\). In \textit{Y. Alavi}, \textit{M. Behzad}, \textit{L. M. Lesniak-Foster} and \textit{E. A. Nordhaus} [J. Graph Theory 1, 135-140 (
Yousef Alavi, Jiuqiang Liu, Jianfang Wang, Zhongfu Zhang   +3 more
openaire   +1 more source