Results 151 to 160 of about 344,286 (183)

The partition dimension of a graph

Aequationes Mathematicae, 2000
An ordered partition of the vertices of a graph \(G\) is resolving if all vertices have distinct vectors of distances to the partition classes. The partition dimension pd\((G)\) of \(G\) is the smallest size of a resolving partition. This turns out to be at most 1 more than the metric dimension, obtained similarly, after substituting partitions by ...
Chartrand, Gary, Salehi, Ebrahim, Zhang, Ping   +2 more
openaire   +1 more source

The partition dimension of Cayley digraphs

aequationes mathematicae, 2006
Let G be a (di)graph and S a set of vertices of G. We say S resolves two vertices u and v of G if d(u, S) ≠ d(v, S). A partition $$ \prod $$ = {P1, P2,..., P k } of V (G) is a resolving partition of G if ...
Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann   +2 more
openaire   +1 more source

Partition of India: The Human Dimension

Cultural and Social History, 2009
The introduction sets the 'new history' of the partition of India in both its historical and historiographical context. It addresses some of the themes and methodologies of the 'new history' and demonstrates how they are taken up by the authors in this Special Issue of the Journal on the theme of the human dimension of the 1947 ...
openaire   +2 more sources

Some trees with partition dimension three

AIP Conference Proceedings, 2016
The concept of partition dimension of a graph was introduced by Chartrand, E. Salehi and P. Zhang (1998) [2]. Let G(V, E) be a connected graph. For S ⊆ V (G) and v ∈ V (G), define the distance d(v, S) from v to S is min{d(v, x)|x ∈ S}. Let Π be an ordered partition of V (G) and Π = {S1, S2, ···, Sk }.
Ketut Queena Fredlina, Edy Tri Baskoro
openaire   +1 more source

Partition dimension of rooted product graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Monica, Mohan Chris, Santhakumar, Samivel   +1 more
openaire   +2 more sources

The partition dimension of circulant graphs

Quaestiones Mathematicae, 2017
No Abstract.
Maritz, Elizabeth C.M., Vetrík, Tomás
openaire   +2 more sources

The number of guillotine partitions in d dimensions

Information Processing Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ackerman, Eyal, Barequet, Gill, Pinter, Ron Y., Romik, Dan   +3 more
openaire   +1 more source

Random walks on random partitions in one dimension

Physical Review E, 1996
Random walks on state space partitions provide an abstract generic picture for the description of macroscopic fluctuations in heterogeneous systems such as proteins. We determine the average residence probability and the average distribution of residence times in a particular macroscopic state for the ensemble of random partitions of a one-dimensional ...
, Nadler, , Huang, , Stein
openaire   +2 more sources

Automatic Domain Partitioning in Three Dimensions

SIAM Journal on Scientific and Statistical Computing, 1991
The problem of automatically decomposing a mesh contained in a three-dimensional domain into p pieces is considered. This problem arises in the context of domain-decomposition solvers for partial differential equations (PDEs). Finite-difference meshes are considered, and a class of graphs that would naturally arise from a finite-element mesh in three ...
openaire   +1 more source

DELAUNAY PARTITIONING IN THREE DIMENSIONS AND SEMICONDUCTOR MODELS

COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, 1986
An algorithm for Delaunay partitioning in three dimensions is given, and its use in numerical semiconductor models is examined. In particular, tetrahedral elements are found to be compatible with the Scharfetter‐Gummel discretization of the stationary continuity equations associated with such models, using the Voronoi cross‐sections for each edge in ...
openaire   +1 more source