Results 111 to 120 of about 8,068,470 (244)

The Metric Dimension of Graph with Pendant Edges [PDF]

, 2008
For an ordered set W = {w_1,w_2,...,w_k} of vertices 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,w_1), d(v,w_2),..., d(v,w_k)) where d(x,y) represents the distance between the ...
Baskoro, Edy Tri, Iswadi, Hazrul, Salman, A.N.M, Simanjuntak, Rinovia   +3 more
core  

Set-Valued Resolvent Equations and Mixed Variational Inequalities

Journal of Mathematical Analysis and Applications, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aslam, Noor Muhammad, Noor, Khalida Inayat, Rassias, Th. M.   +2 more
openaire   +1 more source

Further new results on strong resolving partitions for graphs

Open Mathematics, 2020
A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Kuziak Dorota, Yero Ismael G.
doaj   +1 more source

Weak total resolving sets in graphs

, 2014
A set $W$ of vertices of $G$ is said to be a weak total resolving set for $G$ if $W$ is a resolving set for $G$ as well as for each $w\in W$, there is at least one element in $W-\{w\}$ that resolves $w$ and $v$ for every $v\in V(G)- W$. Weak total metric dimension of $G$ is the smallest order of a weak total resolving set for $G$.
Javaid, Imran, Salman, Muhammad, Murtaza, Mahr, Iftikhar, Farheen, Imran, Muhammad   +4 more
openaire   +2 more sources

Graphs with distinguishing sets of size k

Kuwait Journal of Science
The size of a resolving set R of a non-trivial connected graph Γ of order n ≥ 2 is the number of edges in the induced subgraph .The minimum cardinality of a resolving set of size k of graph Γ is called the metric dimension of size k, denoted by β(k)(Γ ...
Muhammad Naeem Azhar, Muhammad Fazil, Imran Javaid, Muhammad Murtaza   +3 more
doaj   +1 more source

A data set of sea surface stereo images to resolve space-time wave fields [PDF]

, 2020
Pedro Veras Guimarães, Fabrice Ardhuin, Filippo Bergamasco, Fabien Leckler, Jean‐François Filipot, Jae-Seol Shim, V. A. Dulov, Alvise Benetazzo   +7 more
openalex   +1 more source

Meta-Query-Net: Resolving Purity-Informativeness Dilemma in Open-set Active Learning [PDF]

, 2022
Dongmin Park, Yooju Shin, Jihwan Bang, Youngjun Lee, Hwanjun Song, Jae-Gil Lee   +5 more
openalex   +1 more source

Partition Dimension of Generalized Hexagonal Cellular Networks and Its Application

IEEE Access
The notion of partition dimension was initially introduced in the field of graph theory, primarily to examine distances between vertices. The local partition dimension extends this idea by incorporating specific conditions into how vertices are ...
Rabnawaz Bhatti, Muhammad Kamran Jamil, Muhammad Azeem, Prasanna Poojary   +3 more
doaj   +1 more source

A hybrid capture RNA bait set for resolving genetic and evolutionary relationships in angiosperms from deep phylogeny to intraspecific lineage hybridization [PDF]

, 2021
Michelle Waycott, Kor‐jent van Dijk, Ed Biffin   +2 more
openalex   +1 more source

Rational Choice: The Case of Path Dependent Procedures [PDF]

Describing a procedure in which choice proceeds in a sequence, we propose two alternatives ways of resolving the decision problem whenever the outcome is sequence-sensitive.
Bandyopadhyay, Taradas, Kunal Sengupta
core