A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs
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)...
| الحاوية / القاعدة: | مجلة بغداد للعلوم |
|---|---|
| المؤلف الرئيسي: | |
| التنسيق: | مقال |
| اللغة: | الإنجليزية |
| منشور في: |
University of Baghdad, College of Science for Women
2023-03-01
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/8381 |
| _version_ | 1849466291185778688 |
|---|---|
| author | BIBIN K JOSE |
| author_facet | BIBIN K JOSE |
| author_sort | BIBIN K JOSE |
| collection | DOAJ |
| container_title | مجلة بغداد للعلوم |
| description |
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.
|
| format | Article |
| id | doaj-art-eb7742dbe37548cdb8cd238d2e240cf0 |
| institution | Directory of Open Access Journals |
| issn | 2078-8665 2411-7986 |
| language | English |
| publishDate | 2023-03-01 |
| publisher | University of Baghdad, College of Science for Women |
| record_format | Article |
| spelling | doaj-art-eb7742dbe37548cdb8cd238d2e240cf02025-08-20T03:19:56ZengUniversity of Baghdad, College of Science for Womenمجلة بغداد للعلوم2078-86652411-79862023-03-01201(SI)10.21123/bsj.2023.8381A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform GraphsBIBIN K JOSE0P.G. & Research Department of Mathematics, Sanatana Dharma College Alappuzha, Kerala, India. 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. https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/8381Central Subgraphs, Maximal Outerplanar Graphs, ODPU- Graphs, ODPU-Number, ODPU- Set |
| spellingShingle | BIBIN K JOSE A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs Central Subgraphs, Maximal Outerplanar Graphs, ODPU- Graphs, ODPU-Number, ODPU- Set |
| title | A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs |
| title_full | A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs |
| title_fullStr | A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs |
| title_full_unstemmed | A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs |
| title_short | A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs |
| title_sort | characterization of maximal outerplanar open distance pattern uniform graphs |
| topic | Central Subgraphs, Maximal Outerplanar Graphs, ODPU- Graphs, ODPU-Number, ODPU- Set |
| url | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/8381 |
| work_keys_str_mv | AT bibinkjose acharacterizationofmaximalouterplanaropendistancepatternuniformgraphs AT bibinkjose characterizationofmaximalouterplanaropendistancepatternuniformgraphs |