Results 61 to 70 of about 84,964 (255)
Fault-Tolerant Metric Dimension in Carbon Networks
FoundationsIn this paper, we study the fault-tolerant metric dimension in graph theory, an important measure against failures in unique vertex identification. The metric dimension of a graph is the smallest number of vertices required to uniquely identify every ...
Kamran Azhar, Asim Nadeem, Yilun Shang
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An earlier study on children diagnosed with acute lymphoblastic leukemia (ALL) at Moi Teaching and Referral Hospital (MTRH) in Kenya reported a low event‐free survival (EFS), excess treatment abandonment, and high induction mortality.
Gilbert Olbara +7 more
wiley +1 more source
A Central Local Metric Dimension of Generalized Fan Graph, Generalized Broken Fan Graph, and Cm ⊙ K¯m [PDF]
E3S Web of ConferencesThe central local metric dimension is a new variation of local metric dimension that introduced in 2023. The central local metric dimension is a new concept that enriches research studies in graph theory, especially in the field of metric dimension. This
Listiana Yuni, Susilowati Liliek, Slamin
doaj +1 more source
On the Dominant Local Resolving Set of Vertex Amalgamation Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Basically, the new topic of the dominant local metric dimension which be symbolized by Ddim_l (H) is a combination of two concepts in graph theory, they were called the local metric dimension and dominating set. There are some terms in this topic that is
Reni Umilasari +3 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background General pediatricians often evaluate hematologic and oncologic presentations before subspecialty consultation, yet the 2025 Accreditation Council for Graduate Medical Education (ACGME) pediatric requirements reduce inpatient pediatric hematology/oncology (PHO) time, raising questions about resident readiness.
Colburn Yu, Rohini Jain
wiley +1 more source
Optimal Fault-Tolerant Resolving Set of Power Paths
Mathematics, 2023 In a simple connected undirected graph G, an ordered set R of vertices is called a resolving set if for every pair of distinct vertices u and v, there is a vertex w∈R such that d(u,w)≠d(v,w).
Laxman Saha +4 more
doaj +1 more source
On the metric dimension of Grassmann graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity The metric dimension of a graph Gamma is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex.
Robert F. Bailey, Karen Meagher
openaire +5 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT As part of the European Cooperative Study Group for Paediatric Rare Tumours initiative, we developed standard clinical practice guidelines for ovarian sex cord stromal tumors, based on comprehensive national and international cohort analyses, literature review, and a final expert consensus conference.
Dominik T. Schneider +15 more
wiley +1 more source
Fractional metric dimension of metal-organic frameworks
Main Group Metal Chemistry, 2021 Metal-organic frameworks (MOF(n)) are organic-inorganic hybrid crystalline porous materials that consist of a regular array of positively charged metal ions surrounded by organic ‘linker’ molecules.
Raza Mohsin +2 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