Results 1 to 10 of about 28,158 (271)
The edge partition dimension of graphs [PDF]
Discrete Mathematics Letters, 2023 Theedgemetric dimension wasintroduced in 2018 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 andresolving partitions. We define the edge partition dimension of a connected graph and bound it for graphs
Dorota Kuziak +3 more
doaj +5 more sources
All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3 [PDF]
Heliyon, 2020 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 +4 more sources
The partition dimension of a subdivision of a homogeneous firecracker [PDF]
Electronic Journal of Graph Theory and Applications, 2020 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 +5 more sources
On the partition dimension of trees [PDF]
Discrete Applied Mathematics, 2014 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 Lemanska +2 more
exaly +7 more sources
Bounds for partition dimension of M-wheels [PDF]
Open Physics, 2019 Resolving partition and partition dimension have multipurpose applications in computer, networking, optimization, mastermind games and modelling of chemical substances.
Hussain Zafar +6 more
doaj +3 more sources
Computing the partition dimension of certain families of Toeplitz graph [PDF]
Frontiers in Computational Neuroscience, 2022 Let G = (V(G), E(G)) be a graph with no loops, numerous edges, and only one component, which is made up of the vertex set V(G) and the edge set E(G). The distance d(u, v) between two vertices u, v that belong to the vertex set of H is the shortest path ...
Ricai Luo +5 more
doaj +2 more sources
The connected partition dimension of truncated wheels [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 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]
Theoretical Computer Science, 2020 19 pages, 3 ...
Alejandro Estrada-Moreno
exaly +6 more sources
The partition dimension of the vertex amalgamation of some cycles [PDF]
Heliyon, 2022 Let G=(V(G),E(G)) be a connected, finite, simple, and undirected graph. The distance between two vertices u,w∈V(G), denoted by d(u,w), is the shortest length of (u,w)-path in G.
Hasmawati +4 more
doaj +2 more sources
Partition dimension of trees - palm approach
Electronic Journal of Graph Theory and ApplicationsThe 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 +3 more sources