7 papers
Fault tolerance of metric basis can be expensive
Martin Knor, Jelena Sedlar, Riste Škrekovski
A set of vertices S is a resolving set of a graph G; if for every pair of vertices x and y in G, there exists a vertex s in S such that x and y differ in distance to s. A smallest…
Domination number of modular product graphs
Sergio Bermudo, Iztok Peterin, Jelena Sedlar +1
The modular product of graphs and is a graph on vertex set . Two vertices and of are adjacent…
Proper Z4 x Z2-colorings: structural characterization with application to some snarks
Jelena Sedlar, Riste Škrekovski
A proper abelian coloring of a cubic graph G by a finite abelian group A is any proper edge-coloring of G by the non-zero elements of A such that the sum of the colors of the three…
Resolving vertices of graphs with differences
Iztok Peterina, Jelena Sedlar, Riste Škrekovski +1
The classical (vertex) metric dimension of a graph G is defined as the cardinality of a smallest set S in V (G) such that any two vertices x and y from G have different distances t…
Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph
Jelena Sedlar, Riste Škrekovski
In a (proper) edge-coloring of a bridgeless cubic graph G an edge e is rich (resp. poor) if the number of colors of all edges incident to end-vertices of e is 5 (resp. 3). An edge-…
Local Irregularity Conjecture vs. cacti
Jelena Sedlar, Riste Škrekovski
A graph is locally irregular if the degrees of the end-vertices of every edge are distinct. An edge coloring of a graph G is locally irregular if every color induces a locally irre…