Results 61 to 70 of about 13,357,344 (331)
Resolving domination in graphs [PDF]
, 2003 summary:For an ordered set $W =\lbrace w_1, w_2, \cdots , w_k\rbrace $ of vertices and a vertex $v$ in a connected graph $G$, the (metric) representation of $v$ with respect to $W$ is the $k$-vector $r(v|W) = (d(v, w_1),d(v, w_2) ,\cdots , d(v, w_k ...
Dutton, Ronald D. +3 more
core +1 more source
On Resolving Hop Domination in Graphs
European Journal of Pure and Applied Mathematics, 2021 A set S of vertices in a connected graph G is a resolving hop dominating set of G if S is a resolving set in G and for every vertex v ∈ V (G) \ S there exists u ∈ S such that dG(u, v) = 2.
Jerson Mohamad, Helen M. Rara
semanticscholar +1 more source
The general position problem and strong resolving graphs [PDF]
Open Mathematics, 2019 The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
S. Klavžar, I. G. Yero
semanticscholar +1 more source
Resolving Restrained Domination in Graphs
European Journal of Pure and Applied Mathematics, 2021 Let G be a connected graph. Brigham et al. [3] defined a resolving dominating setas a set S of vertices of a connected graph G that is both resolving and dominating.
Gerald B. Monsanto, Helen M. Rara
semanticscholar +1 more source
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 +2 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Embryonal tumors comprise the majority of malignant central nervous system (CNS) neoplasms diagnosed in children under 3 years of age. Compared with their counterparts in older children, these tumors exhibit distinct molecular biology and a more aggressive clinical phenotype, while their management is complicated by the heightened ...
Sudarshawn Damodharan +3 more
wiley +1 more source
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 +2 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background The Standards for Psychosocial Care for Children with Cancer and Their Families (“Standards”) are evidence‐based guidelines for psychosocial care in pediatric oncology. Care related to the three “Asking and Monitoring” Standards—Assessment of Psychosocial Needs, Assessment of Financial Needs, and Monitoring Neurocognitive Problems ...
Julia B. Tager +8 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Pediatric thromboembolism is increasingly encountered in critical care. Systemic thrombolysis with tissue plasminogen activator (tPA) facilitates vessel or valve patency, yet pediatric‐specific protocols remain undefined, and safety concerns persist. Objective To evaluate the efficacy and safety of a tailored, prolonged systemic tPA
Eran Shostak +5 more
wiley +1 more source