Results 1 to 10 of about 406 (100)
The edge partition dimension of graphs [PDF]
Summary: The edge metric dimension was introduced in [\textit{A. Kelenc} et al., Discrete Appl. Math. 251, 204--220 (2018; Zbl 1401.05166)] and since then, it has been extensively studied. In this paper, we present a different way to obtain resolving structures in graphs in order to gain more insight into the study of edge resolving sets and resolving ...
Dorota Kuziak +3 more
doaj +3 more sources
The connected partition dimension of truncated wheels [PDF]
Let G be a connected graph. For a vertex v of G and a subset S of V(G), the distance between v and S is d(v, S) = min Given an ordered k-partition = of V(G), the representation of v with respect to is the k-vector If for each pair of distinct vertices ...
Lyndon L. Lazaro, Jose B. Rosario
doaj +2 more sources
On the k-Partition Dimension of Graphs [PDF]
19 pages, 3 ...
Alejandro Estrada-Moreno
exaly +6 more sources
The partition dimension of a subdivision of a homogeneous firecracker [PDF]
Finding the partition dimension of a graph is one of the interesting (and uncompletely solved) problems of graph theory. For instance, the values of the partition dimensions for most kind of trees are still unknown. Although for several classes of trees
Amrullah Amrullah
doaj +4 more sources
On the Partition Dimension of Trees
Given an ordered partition $Π=\{P_1,P_2, ...,P_t\}$ of the vertex set $V$ of a connected graph $G=(V,E)$, the \emph{partition representation} of a vertex $v\in V$ with respect to the partition $Π$ is the vector $r(v|Π)=(d(v,P_1),d(v,P_2),...,d(v,P_t))$, where $d(v,P_i)$ represents the distance between the vertex $v$ and the set $P_i$.
Magdalena Lemańska +2 more
exaly +6 more sources
Bounds for partition dimension of M-wheels
Resolving partition and partition dimension have multipurpose applications in computer, networking, optimization, mastermind games and modelling of chemical substances.
Hussain Zafar +6 more
doaj +2 more sources
All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
All graphs of order n with partition dimension 2, n−2, n−1, or n have been characterized. However, finding all graphs on n vertices with partition dimension other than these above numbers is still open.
Edy Tri Baskoro, Debi Oktia Haryeni
doaj +3 more sources
Partition dimension of trees - palm approach
The partition dimension of a graph is the minimum number of vertex partitions such that every vertex has different distances to the ordered partitions. Many resolving partitions for trees have all vertices not in an end-path in the same partition.
Yusuf Hafidh, Edy Tri Baskoro
doaj +4 more sources
Partition Dimension of Generalized Petersen Graph
Let G=VG,EG be the connected graph. For any vertex i∈VG and a subset B⊆VG, the distance between i and B is di;B=mindi,j|j∈B. The ordered k-partition of VG is Π=B1,B2,…,Bk. The representation of vertex i with respect to Π is the k-vector, that is, ri|Π=di,
Hassan Raza +3 more
doaj +3 more sources
The Partition Dimension of a Subdivision of a Complete Graph
AbstractThe concept of a graph partition dimension was introduced by Chartrand et al. (1998). Let Π = {L1, L2, L3, · · ·, Lk } be a k-partition of V(G). The representation r(v|Π) of a vertex v with respect to Π is the vector (d(v, L1), d(v, L2), · · ·, d(v, Lk)). The partition Π is called a resolving partition of G if r(w|Π) ≠ r(v|Π) for all distinct w,
Rinovia Simanjuntak, Edy Tri Baskoro
exaly +3 more sources

