The Bridge Graphs Partition Dimension

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Finding the partition dimension of graph is still an open problem in the graph theory. Therefore, several researchers investigate the problem in several operations of the graph. For example, the partition dimension of corona product, cartesian product, subdivision operation has been published by several researchers. Let G1, G2 be two connected graphs. We present the partition dimension of a graph G which is obtained from two graphs G1( G2 with a linking a vertex in G1 to one vertex in G2 (a bridge in graph G). This paper is devoted to find the upper bound of partition dimension of the connected two graphs by a bridge.

Author supplied keywords

Cite

CITATION STYLE

APA

Amrullah, A., Syahrul, A., Turmuzi, M., Baidowi, & Nani, K. (2021). The Bridge Graphs Partition Dimension. In Journal of Physics: Conference Series (Vol. 1779). IOP Publishing Ltd. https://doi.org/10.1088/1742-6596/1779/1/012086

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free