Results 171 to 180 of about 8,099 (211)
Resolving dominating partitions in graphs [PDF]
Discrete 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{
C Hernando +2 more
exaly +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Resolving the partition function’s paradox of the hydrogen atom
Physica A: Statistical Mechanics and Its Applications, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A Plastino, M C Rocca, G L Ferri
exaly +4 more sources
Further new results on strong resolving partitions for graphs [PDF]
Open 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 G Yero
exaly +5 more sources
Equations resolving a conjecture of Rado on partition regularity
Journal of Combinatorial Theory - Series A, 2010 2 pages, no figures.
Boris Alexeev, Jacob Tsimerman
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), 2008Time-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
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ismael G Yero
exaly +3 more sources
On vector space partitions and uniformly resolvable designs
Designs, Codes and Cryptography, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrew Blinco +5 more
openaire +2 more sources
On some resolving partitions for the lexicographic product of two graphs
International Journal of Computer Mathematics, 2016Given a connected graph , the distance between two vertices is the length of a shortest u−v path in G. The distance between a vertex and a subset is defined as . An ordered partition of vertices of G is a resolving partition of G, if for any two different vertices u,v of G there exists such that .
Nicolás Campanelli +1 more
openaire +1 more source
Binary-space-partitioned images for resolving image-based visibility
IEEE Transactions on Visualization and Computer Graphics, 2004We propose a novel 2D representation for 3D visibility sorting, the Binary-Space-Partitioned Image (BSPI), to accelerate real-time image-based rendering. BSPI is an efficient 2D realization of a 3D BSP tree, which is commonly used in computer graphics for time-critical visibility sorting.
Chi-Wing Fu +4 more
openaire +3 more sources
On Partially Resolvable t–Partitions
1982Publisher Summary This chapter discusses partially resolvable t -partitions. The chapter discusses primarily with the case |P|= 1, |S| = 1. The corresponding partially resolvable t -partitions are denoted by PRP t -( p, s, υ ; m ) provided P = { p }, S = { s }.
Charlotte Huang +2 more
openaire +1 more source