4 citations · 4 across the 6 of their papers we have counts for
7 papers · 1 filter
The Möbius-Kantor graph is a faithful unit-distance graph
Nino Bašić, Gábor Gévay, Tomaž Pisanski
In this paper, it has been shown that the generalized Petersen graph , also known as the Möbius-Kantor graph, admits a faithful unit-distance representation in t…
Classification of quartic bicirculant nut graphs
Ivan Damnjanović, Nino Bašić, Tomaž Pisanski +1
A graph is called a nut graph if zero is its eigenvalue of multiplicity one and its corresponding eigenvector has no zero entries. A graph is a bicirculant if it admits an automorp…
On the degrees of regular nut graphs and Cayley nut graphs
Nino Bašić, Ivan Damnjanović, Patrick W. Fowler
A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. It is known that infinitely…
On the Nullity of Altans and Iterated Altans
Nino Bašić, Patrick W. Fowler
Altanisation (formation of the altan of a parent structure) originated in the chemical literature as a formal device for constructing generalised coronenes from smaller structures.…
On singular signed graphs with nullspace spanned by a full vector: Signed nut graphs
Nino Bašić, Patrick W. Fowler, Tomaž Pisanski +1
A signed graph has edge weights drawn from the set , and is termed sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwis…
Point-ellipse and some other exotic configurations
Gábor Gévay, Nino Bašić, Jurij Kovič +1
In this paper we introduce point-ellipse configurations and point-conic configurations. We study some of their basic properties and describe two interesting families of balanced po…
Iterated altans and their properties
Nino Bašić, Tomaž Pisanski
Recently a class of molecular graphs, called altans, became a focus of attention of several theoretical chemists and mathematicians. In this paper we study primary iterated altans…