Strong Total Monophonic Problems in Product Graphs, Networks, and Its Computational Complexity
Let G be a graph with vertex set as VG and edge set as EG which is simple as well as connected. The problem of strong total monophonic set is to find the set of vertices T⊆VG, which contains no isolated vertices, and all the vertices in VG\T lie on a fixed unique chordless path between the pair of v...
Furkejuvvon:
| Váldodahkkit: | , , , , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Wiley
2022-01-01
|
| Ráidu: | Journal of Mathematics |
| Liŋkkat: | http://dx.doi.org/10.1155/2022/6194734 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|