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)...
| Glavni autor: | |
|---|---|
| Format: | Članak |
| Jezik: | Arabic |
| Izdano: |
College of Science for Women, University of Baghdad
2023-03-01
|
| Serija: | Baghdad Science Journal |
| Teme: | |
| Online pristup: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/8381 |