Author:
Amrullah A,Syahrul A.,Turmuzi M.,Baidowi ,Nani K
Abstract
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.
Subject
General Physics and Astronomy
Reference13 articles.
1. The partition dimension of subdivision graph on the star;Amrullah;Journal of Physics: Conference Series,2019
2. The partition dimension of subdivision of a graph;Amrullah;AIP Conference Proceedings,2016
3. The partition dimension for homogeneous firecrackers;Amrullah;Far East Journal of Applied Mathematics,2015
4. The Partition Dimension of a Subdivision of a Complete Graph;Amrullah;Procedia Computer Science,2015
5. The Partition Dimension for a Subdivision of Homogeneous Caterpillars;Amrullah;AKCE International Journal of Graphs and Combinatorics,2013
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献