Results 11 to 20 of about 5,977,062 (227)
THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2 [PDF]
Suppose is a connected graph with elements of a set of vertices denoted by and a subset of . The distance between and is the shortest distance to every vertex in . Let be a partition of , where each subset belongs to .
Jaya Santoso, Darmaji Darmaji
doaj +2 more sources
On the Constant Partition Dimension of Some Generalized Families of Toeplitz Graph
The use of graph theory is prevalent in the field of network design, whereby it finds utility in several domains such as the development of integrated circuits, communication networks, and transportation systems. The comprehension of partition dimensions
Ali N. A. Koam +4 more
doaj +2 more sources
Exchange Property in Double Edge Resolving Partition Sets and Its Use in City Development
The exchange property in double-edge resolving partition sets is examined in this article, along with some real-world applications to city buildings. In graph theory, double-edge resolving sets are essential because they provide information on optimizing transportation and urban infrastructure. When utility units are switched out, the exchange property
Muhammad Kamran Jamil, Sikander Ali
exaly +2 more sources
The connected partition dimension of truncated wheels
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 +1 more source
The partition dimension of the vertex amalgamation of some cycles
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 +1 more source
Computation of Resolvability Parameters for Benzenoid Hammer Graph
A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set.
Ali Ahmad, Al-Nashri Al-Hossain Ahmad
doaj +1 more source
On the Partition Dimension of Tri-Hexagonal α-Boron Nanotube
The production of low-cost, small in size, and high in efficiency objects is the topic of research in almost all scientific fields, especially of engineering. In this scenario, nanotechnology becomes of great importance. To achieve these tasks, one needs
Ayesha Shabbir, Muhammad Azeem
doaj +1 more source
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 +1 more source
On the partition dimension of trees [PDF]
10.1016/j.dam.2013.09.026Given an ordered partition ?={P1,P2,., Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v?V with respect to the partition ? is the vector r(v|?)=(d(v,P1),d(v,P2),.,d(v,Pt)), where d(v,
González Yero, I. +5 more
core +1 more source
Simulating the Greenland ice sheet under present-day and palaeo constraints including a new discharge parameterization [PDF]
In this paper, we propose a new sub-grid scale parameterization for the ice discharge into the ocean through outlet glaciers and inspect the role of different observational and palaeo constraints for the choice of an optimal set of model parameters. This
R. Calov +3 more
doaj +1 more source

