1 citations · 1 across the 11 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.CO2024★ 1 cited
Identification of a monotone Boolean function with "reasons" as a combinatorial search problem
Dániel Gerbner, András Imolay, Gyula O. H. Katona +5
We study the number of queries needed to identify a monotone Boolean function . A query consists of a 0-1-sequence, and the answer is the value of…
math.CO2024
On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph
Dániel Gerbner
Xu in 2011 determined the largest value of the second Zagreb index in an -vertex graph with clique number , and also the smallest value with the additional assumption tha…