3 papers
math.CO2026
Some results on small ordered and cyclic Ramsey numbers
Nino BaÅ¡iÄ, Ivan DamnjanoviÄ, Dragan StevanoviÄ +1
Let and let be simple graphs such that for each , the vertex set of is $\{ 0, 1, 2, \ldots, n_j - 1 \}…
math.CO2025
Nut digraphs
Nino BaÅ¡iÄ, Patrick W. Fowler, Maxine M. McCarthy +1
A nut graph is a simple graph whose kernel is spanned by a single full vector (i.e. the adjacency matrix has a single zero eigenvalue and all non-zero kernel eigenvectors have no z…
math.CO2025
Nut graphs with a prescribed number of vertex and edge orbits
Nino BaÅ¡iÄ, Ivan DamnjanoviÄ
A nut graph is a nontrivial graph whose adjacency matrix has a one-dimensional null space spanned by a vector without zero entries. Recently, it was shown that a nut graph has more…