1.
Graphs with equal Grundy domination and independence numberGábor Bacsó,
Boštjan Brešar,
Kirsti Kuenzel,
Douglas F. Rall, 2023, original scientific article
Abstract: The Grundy domination number, ${\gamma_{\rm gr}}(G)$, of a graph $G$ is the maximum length of a sequence $(v_1,v_2,\ldots, v_k)$ of vertices in $G$ such that for every $i\in \{2,\ldots, k\}$, the closed neighborhood $N[v_i]$ contains a vertex that does not belong to any closed neighborhood $N[v_j]$, where $jKeywords: Grundy domination, independence number, upper domination number, bipartite graphs
Published in DiRROS: 09.04.2024; Views: 97; Downloads: 56
Full text (803,91 KB)
This document has many files! More...
