Buscar
Mostrando ítems 1-1 de 1
Isolation Number versus Domination Number of Trees
(MDPI, 2021-06)
[Abstract] If 𝐺 = (Vɢ,Eɢ) is a graph of order n, we call 𝑆 ⊆ Vɢ an isolating set if the graph induced by Vɢ − Nɢ[𝑆] contains no edges. The minimum cardinality of an isolating set of 𝐺 is called the isolation number of ...