Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Marko Jakovac$"'
Publikováno v:
Communications in Combinatorics and Optimization, Vol 2, Iss 1, Pp 21-33 (2017)
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one more neighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominatin
Externí odkaz:
https://doaj.org/article/f0b458b8217042ca94ee9174e4c149fd
Autor:
Davor Špehar, Marko Jakovac
Publikováno v:
Acta Stomatologica Croatica, Vol 58, Iss 2, Pp 123-135 (2024)
Objectives: The aim of this randomized controlled trial was to see if the minimally invasive approach (reduced restoration thickness) would result in good clinical success of monolithic ceramic crowns compared to conventional layered all-ceramic crow
Externí odkaz:
https://doaj.org/article/72ba731ab66b4c3f9841843e83ae542d
Publikováno v:
Acta Stomatologica Croatica, Vol 56, Iss 2, Pp 162-168 (2022)
Objective: To evaluate the perceptions of altered incisor gingival position among dental specialists, dentists, dental students, and laypeople. Material and methods: Four digital smile photographs with altered gingival margin position of the right ma
Externí odkaz:
https://doaj.org/article/73e957685e7a43da8cff527133ef5630
Publikováno v:
Acta Stomatologica Croatica, Vol 56, Iss 3, Pp 281-287 (2022)
The dental ceramic materials are constantly being developed due to their continuous clinical application in the field of esthetic dentistry. Glass ceramics (GC) materials are also of special interest for dental application due to their specific prope
Externí odkaz:
https://doaj.org/article/2f5e789c0b6e43a0bb947b849a803417
Autor:
Martina Čalušić Šarac, Marko Jakovac
Publikováno v:
Dentistry Journal, Vol 10, Iss 9, p 168 (2022)
Background: This randomized trial’s objective was to investigate the impact of social network content on the perception of smiles among specialists, doctors, students of dental medicine, and laypeople. Method: A sample of 360 respondents was shown
Externí odkaz:
https://doaj.org/article/d483ce32db284700ab6eb6b336e9e8d1
Autor:
Marko Jakovac, Yota Otachi
Publikováno v:
Discrete Applied Mathematics. 304:119-128
A secure set of a graph is, intuitively, a set that can refute any attack from the neighborhood to its subsets. Formally, it is defined as a set S ⊆ V ( G ) such that | N [ X ] ∩ S | ≥ | N [ X ] − S | for all X ⊆ S . Although finding a mini
Publikováno v:
Networks. 80:63-76
For an integer $k\ge 3$, a $k$-path vertex cover of a graph $G=(V,E)$ is a set $T\subseteq V$ that shares a vertex with every path subgraph of order $k$ in $G$. The minimum cardinality of a $k$-path vertex cover is denoted by $\psi_k(G)$. We give est
Autor:
Davor Špehar, Marko Jakovac
Publikováno v:
Acta Stomatologica Croatica, Vol 49, Iss 2, Pp 137-144 (2015)
Dental ceramics represents a major structural material in fixed prosthodontics. Increasing demands for esthetics led to development of new ceramic materials in order to eliminate the use of metal framework and for all ceramic restorations with mechan
Externí odkaz:
https://doaj.org/article/f2e47ef192b44ddf80252162c9a4a198
Publikováno v:
Aequationes mathematicae. 96:137-146
A sequence $$(v_1,\ldots ,v_k)$$ of vertices in a graph G without isolated vertices is called a total dominating sequence if every vertex $$v_i$$ in the sequence totally dominates at least one vertex that was not totally dominated by $$\{v_1,\ldots ,
Publikováno v:
Discrete Applied Mathematics. 289:320-326
The indicated coloring game is played on a simple graph G by two players, with a fixed set C of colors. In each round of the game Ann indicates an uncolored vertex, and Ben colors it using a color from C , obeying just the proper coloring rule. The g