Results 1 to 10 of about 5,977,062 (227)

Structural Analysis of Octagonal Nanotubes via Double Edge-Resolving Partitions

open access: yesProcesses
In materials science, the open nanotube derived from an octagonal grid is one of the most important and extensively researched compounds. Finding strategies for representing a variety of chemical compounds so that different compounds can have different ...
Muhammad Kamran Jamil   +2 more
exaly   +2 more sources
Some of the next articles are maybe not open access.

On the Strong Partition Dimension of Graphs

Electronic Journal of Combinatorics, 2014
Ismael Gonzalez Yero
exaly  

A Note on the Partition Dimension of Cartesian Product Graphs

Applied Mathematics and Computation, 2010
Ismael Gonzalez Yero   +1 more
exaly  

The Partition Dimension of Strong Product Graphs and Cartesian Product Graphs

Discrete Mathematics, 2014
Dorota Kuziak   +2 more
exaly  

Partition Dimension of Rooted Product Graphs

Discrete Applied Mathematics, 2019
exaly  

Further New Results on Strong Resolving Partitions for Graphs [PDF]

open access: yesOpen Mathematics, 2020
A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Dorota Kuziak, Ismael Gonzalez Yero
exaly   +3 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 Ω.
Edy Tri Baskoro, Suhadi Wido Saputro
exaly   +4 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

Computing the Partition Dimension of Certain Families of Toeplitz Graph

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 ...
Muhammad Azeem   +2 more
exaly   +3 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

Home - About - Disclaimer - Privacy