Wyniki wyszukiwania dla: DOMINATION NUMNER

• Graphs with isolation number equal to one third of the order

  Publikacja

  • M. Lemańska
  • M. Mora
  • M. J. Souto Salorio

  - DISCRETE MATHEMATICS - Rok 2024

  A set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...

  Pełny tekst do pobrania w serwisie zewnętrznym