1 citations · 1 across the 5 of their papers we have counts for
6 papers
Bipartite edge frustration of nut graphs: proofs and constructions
Nino Bašić, Patrick W. Fowler
The bipartite edge frustration of a graph , , is the minimum number of edges that must be removed from to obtain a graph that is bipartite. Core graphs are singular gr…
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 \}…
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…
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…
On cubic polycirculant nut graphs
Nino Bašić, Ivan Damnjanović
A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an -circulant graph…
On regular graphs with Šoltés vertices
Nino Bašić, Martin Knor, Riste Škrekovski
Let be the Wiener index of a graph . We say that a vertex is a Šoltés vertex in if , i.e. the Wiener index does not change if the vertex…