Iskanje po repozitoriju

Opis: We describe here how the recent Wagner’s approach for applying reinforcement learning to construct examples in graph theory can be used in the search for critical graphs for small Ramsey numbers. We illustrate this application by providing lower bounds for the small Ramsey numbers R(K_{2, 5}, K_{3, 5}), R(B₃, B₆) and R(B₄, B₅) and by improving the lower known bound for R(W₅, W₇).
Ključne besede: Ramsey number, critical graph, reinforcement learning, cross-entropy method
Objavljeno v RUP: 03.11.2025; Ogledov: 96; Prenosov: 1
Celotno besedilo (291,40 KB)

Opis: While discussing his spectral bound on the independence number of a graph, Herbert Wilf asked back in 1986 what kind of a graph admits an eigenvector consisting solely of ▫$\pm 1$▫ entries? We prove that Wilf's problem is NP-complete, but also that the set of graphs having a ▫$\pm 1$▫ eigenvector is quite rich, being closed under a number of different graph compositions.
Ključne besede: eigenvector, adjacency matrix, Wilf's problem
Objavljeno v RUP: 03.01.2022; Ogledov: 2241; Prenosov: 32
Celotno besedilo (325,02 KB)

Ključne besede: particija grafa, odkrivanje skupnosti, algoritem Kernighan-Lin, maksimalen prerez, spektralna particija, modularnost, enostavna maksimizacija modularnosti, spektralna maksimizacija modularnosti, bisekcija grafa, hierarhično grozdenje, hevristike, aproksimacijski algoritmi, dendrogram
Objavljeno v RUP: 13.11.2017; Ogledov: 3699; Prenosov: 62
Povezava na celotno besedilo

Ključne besede: molecular descriptor, bond-additive descriptor, discrete Adriatic index
Objavljeno v RUP: 03.04.2017; Ogledov: 3343; Prenosov: 127
Povezava na celotno besedilo

Ključne besede: hypergraph, hamiltonian cycle, decomposition, double generalized Petersen graph, automorphism group, vertex-transitive, sign graph, L-eigenvalue, lollipop graph
Objavljeno v RUP: 09.08.2016; Ogledov: 4652; Prenosov: 35
Povezava na celotno besedilo