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...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of Mathematics Ročník 2022; číslo 1
Hlavní autoři:	Varghese, Eddith Sarah, Xavier, D. Antony, Alsinai, Ammar, Mathew, Deepa, Amirtha Raja, S. Arul, Ahmed, Hanan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cairo Hindawi 2022 John Wiley & Sons, Inc Wiley
Témata:	Apexes Graphs Mathematics Police Vertex sets India
ISSN:	2314-4629, 2314-4785
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!