University of Primorska

output

20032026

most citedLatency-Bounded Target Set Selection in Social Networks

66 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

132 papers · 1 filter

math.CO2025★ 1 cited

On the transmission irregular trees with the maximum Wiener index

Ivan Damnjanović, Anran Xu, Kexiang Xu

The transmission of a vertex $v$ in a (chemical) graph $G$ is the sum of distances from $v$ to other vertices in $G$ . If any two vertices of $G$ have different transmissions, then…

math.CO2025★ 3 cited

Classification of borderenergetic chemical graphs and borderenergetic graphs of order 12

Péter Csikvári, Ivan Damnjanović, Marko Milošević +2

The energy $E (G)$ of a simple graph $G$ is the sum of absolute values of the eigenvalues of its adjacency matrix. A borderenergetic graph of order $n \in N$ is any noncomp…

math.CO2025

Self-reverse labelings of distance magic graphs

Petr Kovář, Ksenija Rozman, Primož Šparl

A graph is distance magic if it admits a bijective labeling of its vertices by integers from $1$ up to the order of the graph in such a way that the sum of the labels of all the ne…

math.CO2025

Vertex-transitive nut graph order-degree existence problem

Ivan Damnjanović

A nut graph is a nontrivial simple graph whose adjacency matrix has a simple eigenvalue zero such that the corresponding eigenvector has no zero entries. It is known that the order…

math.CO2025

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…

math.CO2024

Multisets with few special directions and small weight codewords in Desarguesian planes

Sam Adriaensen, Tamás Szőnyi, Zsuzsa Weiner

In this paper, we tie together two well studied topics related to finite Desarguesian affine and projective planes. The first topic concerns directions determined by a set, or even…

math.CO2024★ 1 cited

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…

math.CO2024

A short proof of the Hilton-Milner Theorem

Denys Bulavka, Russ Woodroofe

We give a short and relatively elementary proof of the Hilton-Milner Theorem.

math.CO2024

Monoid algebras and graph products

Wilfried Imrich, Igor Klep, Daniel Smertnig

In this note, we extend results about unique $n^{th}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product…

math.CO2024

The association scheme on the set of flags of a finite generalized quadrangle

Francesco Colangelo, Giusy Monzillo, Alessandro Siciliano

In this paper, the association scheme defined on the flags of a finite generalized quadrangle is considered. All possible fusions of this scheme are listed, and a full description…

math.CO2024

A Hilton-Milner theorem for exterior algebras

Denys Bulavka, Francesca Gandini, Russ Woodroofe

Recent work of Scott and Wilmer and of Woodroofe extends the Erdős-Ko-Rado theorem from set systems to subspaces of k-forms in an exterior algebra. We prove an extension of the Hil…

math.CO2024★ 1 cited

Simplicial complexes with many facets are vertex decomposable

Anton Dochtermann, Ritika Nair, Jay Schweig +2

Suppose $Δ$ is a pure simplicial complex on $n$ vertices having dimension $d$ and let $c = n - d - 1$ be its codimension in the simplex. Terai and Yoshida proved that if the number of…

math.CO2023★ 5 cited

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…

math.CO2023★ 2 cited

Packing coloring of hypercubes with extended Hamming codes

Petr Gregor, Jaka Kranjc, Borut Lužar +1

A {\em packing coloring} of a graph $G$ is a mapping assigning a positive integer (a color) to every vertex of $G$ such that every two vertices of color $k$ are at distance at leas…

math.CO2023

Stability of Cayley graphs and Schur rings

Ademir Hujdurović, István Kovács

A graph $Γ$ is said to be unstable if for the direct product $Γ \times K_{2}$ , $A u t (Γ \times K_{2})$ is not isomorphic to $A u t (Γ) \times Z_{2}$ . In this paper we show that a conne…

math.CO2023★ 1 cited

Cubic factor-invariant graphs of cycle quotient type -- the alternating case

Brian Alspach, Primoz Sparl

We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a $2$ -factor $C$ and a $1$ -factor that is invariant under a vertex-transiti…

math.CO2023

Symmetries of the Woolly Hat graphs

Leah Wrenn Berman, Hiroki Koike, Elias Mochan +3

A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subg…

math.CO2023

Functionality of box intersection graphs

Clément Dallard, Vadim Lozin, Martin Milanič +2

Functionality is a graph complexity measure that extends a variety of parameters, such as vertex degree, degeneracy, clique-width, or twin-width. In the present paper, we show that…

math.CO2022

Spectral properties of balanced trees and dendrimers

Ivan Damnjanović, Slobodan Filipovski, Dragan Stevanović

We investigate the spectral properties of balanced trees and dendrimers, with a view toward unifying and improving the existing results. Here we find a semi-factorized formula for…

math.CO2022★ 2 cited

A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups

J. Pascal Gollin, Kevin Hendrey, O-joung Kwon +2

In 1965, Erdős and Pósa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such…

math.CO2022

The extensible No-Three-In-Line problem

Dániel T. Nagy, Zoltán Lóránt Nagy, Russ Woodroofe

The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an $n \times n$ grid while avoiding a collinear triple. The maximum is well known…

math.CO2022

Some results on LCTR, an impartial game on partitions

Eric Gottlieb, Jelena Ilić, Matjaž Krnc

We apply the Sprague-Grundy Theorem to LCTR, a new impartial game on partitions in which players take turns removing either the Left Column or the Top Row of the corresponding Youn…

math.CO2022★ 8 cited

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

Marthe Bonamy, Édouard Bonnet, Hugues Déprés +5

A graph is $O_{k}$ -free if it does not contain $k$ pairwise vertex-disjoint and non-adjacent cycles. We prove that "sparse" (here, not containing large complete bipartite g…

math.CO2022★ 4 cited

On distance magic circulants of valency 6

Štefko Miklavič, Primož Šparl

A graph $Γ = (V, E)$ of order $n$ is {\em distance magic} if it admits a bijective labeling $ℓ : V \to {1, 2, \dots, n}$ of its vertices for which there exists a positive i…