Results 201 to 210 of about 424,178 (243)

Resolving Dominating Partitions in Graphs [PDF]

open access: yesDiscrete Applied Mathematics, 2019
A partition $Π=\{S_1,\ldots,S_k\}$ of the vertex set of a connected graph $G$ is called a \emph{resolving partition} of $G$ if for every pair of vertices $u$ and $v$, $d(u,S_j)\neq d(v,S_j)$, for some part $S_j$. The \emph{partition dimension} $β_p(G)$ is the minimum cardinality of a resolving partition of $G$. A resolving partition $Π$ is called \emph{
Mercè Mora Gine   +2 more
exaly   +7 more sources

Further New Results on Strong Resolving Partitions for Graphs [PDF]

open access: yesOpen Mathematics, 2020
Abstract 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
Dorota Kuziak, Ismael Gonzalez Yero
exaly   +5 more sources
Some of the next articles are maybe not open access.

Related searches:

Resolving the Partition Function’s Paradox of the Hydrogen Atom

Physica A: Statistical Mechanics and Its Applications, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angel Plastino, G L Ferri, M C Rocca
exaly   +4 more sources

Starting and Resolving a Partitioned BRAIN

2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC), 2008
Time-triggered communication is a favored design strategy for safety-critical systems. However, the startup of time-triggered systems is a significant concern, since the time-line from which fault-tolerance is supported must be established in segmented mediums, e.g. multi-hop networks.
Michael Paulitsch, Brendan Hall
openaire   +1 more source

Strong Resolving Partitions for Strong Product Graphs and Cartesian Product Graphs

open access: yesDiscrete Applied Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ismael Gonzalez Yero
exaly   +3 more sources

Home - About - Disclaimer - Privacy