Results 41 to 50 of about 60,505 (275)
Psychosocial development and attachment in late adolescence [PDF]
Psihološka Istraživanja, 2021 The study deals with the relationship between psychosocial development and attachment in late adolescence. The aim is to examine the relationship between the success in resolving the crises of psychosocial development and attachment dimensions and to ...
Lelek Aleksandra, Klikovac Tamara
doaj +1 more source
Non-Isolated Resolving Sets of Corona Graphs with Some Regular Graphs
Mathematics, 2022 Let G be a connected, simple, and finite graph. For an ordered set W={w1,w2,…,wk}⊆V(G) and a vertex v of G, the representation of v with respect to W is the k-vector r(v|W)=(dG(v,w1),…,dG(v,wk)).
Wahyuni Abidin +2 more
doaj +1 more source
Computing Edge Metric Dimension of One-Pentagonal Carbon Nanocone
Frontiers in Physics, 2021 Minimum resolving sets (edge or vertex) have become an integral part of molecular topology and combinatorial chemistry. Resolving sets for a specific network provide crucial information required for the identification of each item contained in the ...
Sunny Kumar Sharma +2 more
doaj +1 more source
Determining Sets, Resolving Sets, and the Exchange Property [PDF]
Graphs and Combinatorics, 2009 A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U. A subset W is called a resolving set if every vertex in G is uniquely determined by its distances to the vertices of W. Determining (resolving) sets are said to have the exchange property in G if whenever
openaire +2 more sources
Resolving Independent Dominating Set pada Graf Bunga, Graf Gear, dan Graf Bunga Matahari
Contemporary Mathematics and Applications (ConMathA), 2023 Resolving independent dominating set is the development of metric dimension and independent dominating set. Resolving independent dominating sets is a concept which discusses about determining the minimum vertex on a graph provided that the vertex that ...
Rafiantika Megahniah Prihandini +4 more
doaj +1 more source
Resolving-power dominating sets
Applied Mathematics and Computation, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sudeep Stephen +3 more
openaire +3 more sources
Semiclassical resolvent estimates at trapped sets [PDF]
Annales de l'Institut Fourier, 2012 We extend our recent results on propagation of semiclassical resolvent estimates through trapped sets when a priori polynomial resolvent bounds hold. Previously we obtained non-trapping estimates in trapping situations when the resolvent was sandwiched between cutoffs χ
Datchev, Kiril, Vasy, András
openaire +2 more sources
Levenshtein graphs: Resolvability, automorphisms & determining sets
Discrete Mathematics, 2023 22 pages, 3 ...
Perrin E. Ruth, Manuel E. Lladser
openaire +2 more sources
Fault-Tolerant Resolvability and Extremal Structures of Graphs
Mathematics, 2019 In this paper, we consider fault-tolerant resolving sets in graphs. We characterize n-vertex graphs with fault-tolerant metric dimension n, n − 1 , and 2, which are the lower and upper extremal cases.
Hassan Raza +3 more
doaj +1 more source
Kyoto Journal of Mathematics, 1986 We want to add here another two proofs that the resolvent set of a linear operator is open. The first proof depends on the Hahn-Banach theorem and the second on the Neumann series construction of a linear isomorphism between Ran(A-\(\lambda)\) and Ran(A-\(\mu)\).
Ikebe, Teruo, Yoshioka, Takashi
openaire +3 more sources