1.
Graphs with equal Grundy domination and independence numberGábor Bacsó,
Boštjan Brešar,
Kirsti Kuenzel,
Douglas F. Rall, 2023, izvirni znanstveni članek
Povzetek: 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 $jKljučne besede: Grundy domination, independence number, upper domination number, bipartite graphs
Objavljeno v DiRROS: 09.04.2024; Ogledov: 99; Prenosov: 58
Celotno besedilo (803,91 KB)
Gradivo ima več datotek! Več...
