Results 251 to 260 of about 1,385,528 (273)
Some of the next articles are maybe not open access.
The Partition Dimension of a Graph
Aequationes Mathematicae, 2000An 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 +2 more
exaly +2 more sources
Partition Dimension of Rooted Product Graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohan Chris Monica, Samivel Santhakumar
exaly +4 more sources
The Partition Dimension of Cayley Digraphs
Aequationes Mathematicae, 2006Let 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 ...
Ortrud Oellermann
exaly +2 more sources
Computation of Metric Dimension and Partition Dimension of Nanotubes
Journal of Computational and Theoretical Nanoscience, 2015Muhammad Imran +1 more
exaly +2 more sources
The local partition dimension of graphs
Discrete Mathematics, Algorithms and Applications, 2020All graphs in this paper are undirected and connected graphs. An ordered k-partition set [Formula: see text] where [Formula: see text], the representation of a vertex [Formula: see text] of [Formula: see text] with respect to [Formula: see text] is [Formula: see text] where [Formula: see text] is the distance between the vertex v and the set [Formula:
Ridho Alfarisi +2 more
openaire +2 more sources
On fault-tolerant partition dimension of graphs
Journal of Intelligent & Fuzzy Systems, 2021Fault-tolerant resolving partition is natural extension of resolving partitions which have many applications in different areas of computer sciences for example sensor networking, intelligent systems, optimization and robot navigation. For a nontrivial connected graph G (V (G) , E (G)), the partition representation of vertex v with respect to an ...
Kamran Azhar +3 more
openaire +2 more sources
On the Partition Dimension of Circulant Graphs
The Computer Journal, 2016For a vertex v of a connected graph G ( V , E ) and a subset S of V , the distance between v and S is defined by d ( v , S )=min{ d ( v , x ):x∈ S }. For an ordered k .-partition Π={ S 1 , S 2 ,…, S k } of V , the representation of v with respect to Π is the k -vector r ( v ∣Π)=( d ( v , S 1 ), d ( v , S 2 ),…, d ( v , S k )).
Cyriac Grigorious +3 more
openaire +2 more sources
The Wästlund Partition in Higher Dimensions
The American Mathematical Monthly, 2020We prove that the set {(x1,x2,…,xd)∈R≥0d;:;x1p+x2p+⋯+xdp≤1} has volume Γ(1+1/p)d/Γ(1+d/p) using a partition of the positive orthant, which we name in honor of Wastlund.
openaire +2 more sources
On 2-partition dimension of the circulant graphs
Journal of Intelligent & Fuzzy Systems, 2021The partition dimension is a variant of metric dimension in graphs. It has arising applications in the fields of network designing, robot navigation, pattern recognition and image processing. Let G (V (G) , E (G)) be a connected graph and Γ = {P1, P2, …, Pm} be an ordered m-partition of V (G).
Asim Nadeem +3 more
openaire +1 more source
The number of guillotine partitions in d dimensions
Information Processing Letters, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eyal Ackerman +3 more
openaire +2 more sources

