Jelena Sedlar

Orcid: 0000-0002-8973-5163

According to our database1, Jelena Sedlar authored at least 19 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Resolving vertices of graphs with differences.
Comput. Appl. Math., July, 2024

Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph.
Appl. Math. Comput., April, 2024

Local Irregularity Conjecture vs. cacti.
Discret. Appl. Math., January, 2024

Normal 5-edge-coloring of some snarks superpositioned by Flower snarks.
Eur. J. Comb., 2024

2022
Vertex and edge metric dimensions of cacti.
Discret. Appl. Math., 2022

Vertex and edge metric dimensions of unicyclic graphs.
Discret. Appl. Math., 2022

Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two.
Appl. Math. Comput., 2022

2021
Mixed metric dimension of graphs with edge disjoint cycles.
Discret. Appl. Math., 2021

Extremal mixed metric dimension with respect to the cyclomatic number.
Appl. Math. Comput., 2021

Bounds on metric dimensions of graphs with edge disjoint cycles.
Appl. Math. Comput., 2021

2020
A new surrogate measure for resilient approach to construction scheduling.
Proceedings of the CENTERIS 2020 - International Conference on ENTERprise Information Systems / ProjMAN 2020 - International Conference on Project MANagement / HCist 2020, 2020

2018
Global forcing number for maximal matchings.
Discret. Math., 2018

On indices of Wiener and anti-Wiener type.
Discret. Appl. Math., 2018

On Wiener inverse interval problem of trees.
Ars Math. Contemp., 2018

2015
On the inverse sum indeg index.
Discret. Appl. Math., 2015

2014
Compression ratio of Wiener index in 2-d rectangular and polygonal lattices.
Ars Math. Contemp., 2014

2012
The global forcing number of the parallelogram polyhex.
Discret. Appl. Math., 2012

2011
Using size for bounding expressions of graph invariants.
Ann. Oper. Res., 2011

2010
Variable Neighborhood Search for Extremal Graphs, 24. Results about the clique number.
Stud. Inform. Univ., 2010


  Loading...