2 citations · 2 across the 10 of their papers we have counts for
12 papers
(Total) Domination in Prisms
Jernej Azarija, Michael A. Henning, Sandi Klavžar
With the aid of hypergraph transversals it is proved that , where and denote the total domination number and the domination number of , r…
There is no (95,40,12,20) strongly regular graph
Jernej Azarija, Tilen Marc
We show that there is no strongly regular graph and, consequently, there is no strongly regular graph, no two-graph on vertices, and no partial…
There is no (75,32,10,16) strongly regular graph
Jernej Azarija, Tilen Marc
We show that there is no (75,32,10,16) strongly regular graph. The result is obtained by a mix of algebraic and computational approaches. The main idea is to build large enough ind…
Vertex and edge orbits of Fibonacci and Lucas cubes
Ali Reza Ashrafi, Jernej Azarija, Khadijeh Fathalikhani +2
The Fibonacci cube is obtained from the -cube by removing all the vertices that contain two consecutive 1s. If, in addition, the vertices that start and end with 1 a…
On Isomorphism Classes of Generalized Fibonacci Cubes
Jernej Azarija, Sandi Klavžar, Jaehun Lee +2
The generalized Fibonacci cube is the subgraph of the -cube induced on the set of all strings of length that do not contain as a substring. It is proved t…
Tutte polynomials and a stronger version of the Akiyama-Harary problem
Jernej Azarija
Can a non self-complementary graph have the same chromatic polynomial as its complement? The answer to this question of Akiyama and Harrary is positive and was given by J. Xu and Z…