Results 11 to 20 of about 1,385,528 (273)

On Partition Dimension of Generalized Convex Polytopes

open access: yesJournal of Mathematics, 2023
Let G be a graph having no loop or multiple edges, k−order vertex partition for G is represented by γ=γ1,γ2,…,γk. The vector rϕγ=dϕ,γ1,dϕ,γ2,dϕ,γ3⋯,dϕ,γk is the representation of vertex ϕ with respect to γ.
Syed Waqas Shah   +5 more
doaj   +2 more sources

Computing the partition dimension of certain families of Toeplitz graph [PDF]

open access: yesFrontiers 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

On the Bounded Partition Dimension of Some Generalised Graph Structures

open access: yesJournal of Mathematics, 2022
Consider λ to be a connected graph with a vertex set Vλ that may be partitioned into any partition set S. If each vertex in λ has a separate representation with regard to S and is an ordered k partition, then the set with S is a resolving partition of λ..
Wajdi Alghamdi, Muhammad Ahsan Asim
doaj   +2 more sources

The partition dimension of the vertex amalgamation of some cycles [PDF]

open access: yesHeliyon, 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

On The Partition Dimension of Disconnected Graphs [PDF]

open access: yesJournal of Mathematical and Fundamental Sciences, 2017
For a graph G=(V,E), a partition Ω=\{O_1,O_2,…,O_k \} of the vertex set V is called a resolving partition if every pair of vertices u,v∈V(G) have distinct representations under Ω.
Debi Oktia Haryeni   +2 more
doaj   +2 more sources

Partition dimension of projective planes [PDF]

open access: yesEuropean Journal of Combinatorics, 2017
11 ...
Blázsik, Zoltán   +1 more
openaire   +6 more sources

Local Partition Dimension of Grid Graph and Its Application to the Coordinates of Potential Disaster Areas in Jember Regency [PDF]

open access: yesJTAM (Jurnal Teori dan Aplikasi Matematika), 2023
Partition dimension was introduced as a part of interesting topic in graph theory. It was focus to observe about distance. The local partition dimension is an expansion of the partition dimension by adding certain conditions to the representation of the ...
Ilham Saifudin   +2 more
doaj   +4 more sources

Partition dimension of disjoint union of complete bipartite graphs

open access: yesDesimal, 2021
For any (not necessary connected) graph $G(V,E)$ and $A\subseteq V(G)$, the distance of a vertex $x\in V(G)$ and $A$ is $d(x,A)=\min\{d(x,a): a\in A\}$. A subset of vertices $A$ resolves two vertices $x,y \in V(G)$ if $d(x,A)\neq d(y,A)$.
Debi Oktia Haryeni   +2 more
doaj   +2 more sources

Sharp bounds for partition dimension of generalized Möbius ladders

open access: yesOpen Mathematics, 2018
The concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing.
Hussain Zafar   +4 more
doaj   +2 more sources

Partition Dimension of Some Classes of Trees

open access: yesProcedia Computer Science, 2015
AbstractChartrand, E. Salehi and P. Zhang (1998) studied the concept of graph partition dimension as a new approach to settle the problem of finding the metric dimension of a graph. Now, the partition dimensions of many classes of trees have been known. However, there are the partition dimension of a general tree is still not completely solved. In this
Edy Tri Baskoro
exaly   +2 more sources

Home - About - Disclaimer - Privacy