How large part of a graph can be covered by the neighborhoods of k vertices?

Documenti analoghi

• $k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$
  di: Cichacz, Sylwia, et al.
  Pubblicazione: (2022)
• Sharp bounds for covering with large cliques and independent sets
  di: Bitonti, Veronica, et al.
  Pubblicazione: (2026)
• The minimum number of vertices and edges of connected graphs with ind-match$(G) = p$, min-match$(G) = q$ and match$(G) = r$
  di: Matsuda, Kazunori, et al.
  Pubblicazione: (2025)
• On the independence number in subcubic graphs
  di: Harant, Jochen, et al.
  Pubblicazione: (2025)
• Lower bounds on the independence number of a graph in terms of degrees
  di: Harant, Jochen, et al.
  Pubblicazione: (2025)