A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs

Main Article Content



Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph is either two or five only.


Download data is not yet available.

Article Details

How to Cite
JOSE BK. A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs. Baghdad Sci.J [Internet]. 2023 Mar. 1 [cited 2023 Mar. 21];20(1(SI):0245. Available from: https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/8381


Jose BK.Open Distance Pattern Uniform Graphs.Int J Math Combin. 2009; 3(3): 103-115.

Proskurowsski A. Centers of Maximal Outer Planar Graphs.J Graph Theory. 1980; 4:75-79.

Adirasari RP, Suprajitno H, Susilowati L. The Dominant Metric Dimension of Corona Product Graphs. Baghdad Sci J. 2021 Jun. 1; 18(2): 0349. https://doi.org/10.21123/bsj.2021.18.2.0349

Mitlif RJ, Al-Harere MN, Sadiq FA. Variant Domination Types for a Complete h-ary Tree. Baghdad Sci J. 2021 Mar. 30; 18(1(Suppl.): 0797. https://doi.org/10.21123/bsj.2021.18.1(Suppl.).0797

Aisyah S, Utoyo MI, Susilowati L. Fractional Local Metric Dimension of Comb Product Graphs. Baghdad Sci J. 2020 Dec. 1; 17(4):1288. https://doi.org/10.21123/bsj.2020.17.4.1288

Al-Harere MN, Omran AA. On Binary Operation Graphs. Bol Soc Paran Mat. 2020; 38(7): 59–67.

González A, Hernando C, Mora M. Metric-locating- dominating sets of graph for constructing related subsets of vertex. Appl Math Comput. 2018; 332: 449-456.