Abstract
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.
Keywords
Central Subgraphs, Maximal Outerplanar Graphs, ODPU- Graphs, ODPU-Number, ODPU- Set
Article Type
Special Issue Article
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite this Article
JOSE, BIBIN K
(2023)
"A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs,"
Baghdad Science Journal: Vol. 20:
Iss.
1, Article 26.
DOI: https://doi.org/10.21123/bsj.2023.8381
