Digital repository of Slovenian research organisations

Search the repository
A+ | A- | Help | SLO | ENG

Query: search in
search in
search in
search in

Options:
  Reset


Query: "keywords" (independence number) .

1 - 2 / 2
First pagePrevious page1Next pageLast page
1.
Graphs with equal Grundy domination and independence number
Gá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: 73; Downloads: 42
.pdf Full text (803,91 KB)
This document has many files! More...

2.
Domination and independence numbers of large 2-crossing-critical graphs
Vesna Iršič, Maruša Lekše, Miha Pačnik, Petra Podlogar, Martin Praček, 2023, original scientific article

Abstract: After 2-crossing-critical graphs were characterized in 2016, their most general subfamily, large 3-connected 2-crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their domination and independence number.
Keywords: crossing-critical graphs, domination number, independence number
Published in DiRROS: 09.04.2024; Views: 60; Downloads: 34
.pdf Full text (393,09 KB)
This document has many files! More...
Search done in 0.07 sec.
Back to top