13 citations · 39 across the 25 of their papers we have counts for
31 papers
Optimization problem for star covers of graphs without four cycles
Damjana Kokol Bukovšek, Polona Oblak, Helena Šmigoc
This work presents a study of star covers on graphs. Unlike traditional formulations that minimize the number of stars, our aim is to optimize the number of bipartite components us…
Combinatorial aspects of the non-symmetric strong spectral property for graphs
Sara Koljančić, Polona Oblak
In this paper, we investigate the non-symmetric Strong Spectral Property (nSSP) from a combinatorial perspective. To zero-nonzero patterns of matrices we associate directed graphs…
Orthogonalisability of joins of graphs
Rupert H. Levene, Polona Oblak, Helena Šmigoc
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some…
The strong spectral property for some families of unicyclic graphs
Sara Koljančić, Polona Oblak
To find all the possible spectra of all real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of a given graph , the Strong Spectral Property turne…
Matrix tri-factorization over the tropical semiring
Amra Omanović, Polona Oblak, Tomaž Curk
Tropical semiring has proven successful in several research areas, including optimal control, bioinformatics, discrete event systems, or solving a decision problem. In previous stu…
Bordering of Symmetric Matrices and an Application to the Minimum Number of Distinct Eigenvalues for the Join of Graphs
Aida Abiad, Shaun M. Fallat, Mark Kempton +5
An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number of distinct eigenvalues of a particular graph. We resolve this question for the j…