Results 51 to 60 of about 147,496 (294)

Resolving Domination Number pada Keluarga Graf Buku [PDF]

, 2021
Topik yang digunakan sebagai bahan kajian dalam penelitian ini adalah Resolving Domination Number. Resolvinig domination number adalah kardinalitas minimum dari resolving dominating set pada graf G.
FUIDAH, Quthrotul Aini
core  

DIMENSI METRIK GRAPH LOBSTER Ln (q;r)

E-Jurnal Matematika, 2013
The metric dimension of connected graph G is the cardinality of minimum resolving set in graph G. In this research, we study how to find the metric dimension of lobster graph Ln (q;r).
PANDE GDE DONY GUMILAR, LUH PUTU IDA HARINI, KARTIKA SARI   +2 more
doaj   +1 more source

Genomic Diversity and Clinical Variability in Pediatric Primary Cutaneous Anaplastic Large Cell Lymphoma: A Case Series

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Primary cutaneous anaplastic large cell lymphoma (pcALCL) is a rare pediatric CD30‐positive T‐cell lymphoproliferative disorder with an excellent prognosis, but its genomic drivers are poorly defined. We report three children with skin‐limited disease demonstrating striking molecular heterogeneity, including NPM::ALK, NUP214::FRK, and a novel ...
Shoshana Greenberger, Efrat Bar‐Ilan, Victoria Marcu, Evgeny Grishin, Rinat Yacobi, Aviv Barzilai, Hana Golan, Assaf Arie Barg   +7 more
wiley   +1 more source

Overlarge sets of resolvable idempotent quasigroups

Discrete Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Y. Chang, LO FARO, Giovanni, TRIPODI, Antoinette, J. Zhou   +3 more
openaire   +2 more sources

The Non-Isolated Resolving Number of Some Corona Graphs [PDF]

, 2018
An ordered set W = {w1, w2, ..., wk} ⊆ V(G) and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W) = (d(v, w1), d(v, w2), ..., d(v, wk)), where d(x, y) represents the distance between the vertices x
Salman, Anm, Saputro, Suhadi Wido, Abidin, Wahyuni   +2 more
core   +1 more source

Dimensi Metrik Hasil Operasi Korona Antara Graf Lintasan Dengan Graf Lengkap (P_N ⨀ K_M) Dan Graf Sikel Dengan Graf Lintasan (C_N ⨀ Mp_2)

Primatika, 2019
Graf merupakan suatu (V, E) dengan V adalah himpunan simpul dan E adalah himpunan edge, yaitu pasangan simpul dari V. Jika G adalah graf terhubung, jarak antara dua simpul u dan v di G dinotasikan dengan adalah panjang lintasan terpendek di antara ...
Petrus Fendiyanto
doaj   +1 more source

Metric dimension of ideal-intersection graph of the ring

AKCE International Journal of Graphs and Combinatorics, 2021
Metric Dimension of a simple connected graph is the minimum number of vertices those are used to identify each vertex of the graph uniquely using distance code. In this paper, we determine metric dimension of ideal-intersection graph for the ring where n
Laxman Saha, Mithun Basak, Kalishankar Tiwary   +2 more
doaj   +1 more source

Prevalence of 21 Physician‐Defined Severe Toxicities Following Childhood Acute Lymphoblastic Leukemia Treatment: Australian Retrospective Cohort Study

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background Acute lymphoblastic leukemia (ALL) is the most common pediatric cancer, with an overall survival now surpassing 90% in developed countries. However, treatments are not without adverse effects. In this study, we apply the severe toxicity‐free survival (STFS) framework to determine the prevalence of 21 physician‐defined severe ...
Lane Collier, Brittany Grantham, Camilla Grud Nielsen, Louise Lundgren, Liv Andrés‐Jensen, Kjeld Schmiegelow, Chris Selman, Gareth Ball, Elyse Passmore, David A. Elliott, Rachel Conyers   +10 more
wiley   +1 more source

The independent resolving number of a graph [PDF]

, 2003
summary:For an ordered set $W=\lbrace w_1, w_2, \dots , w_k\rbrace $ of vertices in a connected graph $G$ and a vertex $v$ of $G$, the code of $v$ with respect to $W$ is the $k$-vector \[ c_W(v) = (d(v, w_1), d(v, w_2), \dots , d(v, w_k) ). \] The set $W$
Zhang, P., Chartrand, G., Saenpholphat, V.   +2 more
core   +1 more source

Application of neutrosophic resolving sets in earthquake disaster management using neutrosophic graph models [PDF]

Neutrosophic Sets and Systems
Neutrosophic graphs are more suitable for modelling real-life situations because real world data is often uncertain, incomplete, inconsistent, or indeterminate and neutrosophic graphs are specifically designed to handle all of neutrosophic graphs, these ...
R. Shanmugapriya, R. Shanmugapriya
doaj   +1 more source