9 citations · 26 across the 8 of their papers we have counts for
12 papers
Towards a format for describing networks / 2. Format elements
Vladimir Batagelj, Tomaž Pisanski, Iztok Savnik +2
The key elements that a common format for describing networks should include are discussed.
Towards a format for describing networks / 1. Networks and knowledge graphs
Vladimir Batagelj, Tomaž Pisanski, Iztok Savnik +2
The relationship between the concepts of network and knowledge graph is explored. A knowledge graph can be considered a special type of network. When using a knowledge graph, vario…
Nut graphs with a given automorphism group
Nino Bašić, Patrick W. Fowler
A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry (i.e. are…
Classification of cubic tricirculant nut graphs
Ivan Damnjanović, Nino Bašić, Tomaž Pisanski +1
A nut graph is a simple graph whose adjacency matrix has the eigenvalue zero with multiplicity one such that its corresponding eigenvector has no zero entries. It is known that the…
Solving the Mostar index inverse problem
Yaser Alizadeh, Nino Bašić, Ivan Damnjanović +4
A nonnegative integer is realizable by a graph-theoretical invariant if there exist a graph such that . The inverse problem for consists of finding all no…
Vertex and edge orbits in nut graphs
Nino Bašić, Patrick W. Fowler, Tomaž Pisanski
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. If the isolated vertex is e…