- Full text PDF available (25)
- This year (0)
- Last 5 years (13)
- Last 10 years (23)
Journals and Conferences
Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiński graphs S(n, k), graphs S (n, k), and graphs S(n, k) are considered. In particular, χ′′(Sn), χ (S(n, k)), χ(S(n, k)), χ(S(n, k)), χ(S(n, k)), and χ(S(n, k)) are determined.
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex that has a neighbor in each of the other color classes. We prove that every d-regular graph with at least 2d vertices has b-chromatic number d + 1, that the b-chromatic number of an arbitrary d-regular… (More)
The b-chromatic index φ(G) of a graph G is the largest integer k such that G admits a proper k-edge coloring in which every color class contains at least one edge incident to some edge in all the other color classes. The b-chromatic index of trees is determined and equals either to a natural upper bound m(T ) or one less, where m(T ) is connected with the… (More)
A b-coloring is a proper vertex coloring of a graph such that each color class contains a vertex that has a neighbor in all other color classes and the b-chromatic number is the largest integer φ(G) for which a graph has a bcoloring with φ(G) colors. We determine some upper and lower bounds for the b-chromatic number of the strong product G H, the… (More)
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this paper improved lower and upper bounds for ψk of the Cartesian and the direct product of paths are derived. It is shown that for ψ3 those bounds… (More)
Graphs S[n, k] are introduced as the graphs obtained from the Sierpiński graphs S(n, k) by contracting edges that lie in no triangle. The family S[n, k] is a previously studied class of Sierpiński gasket graphs Sn. Several properties of graphs S[n, k] are studied in particular, hamiltonicity and chromatic number.
Dental materials need to be thoroughly examined in order to assess their long-term therapeutical value. Chemical degradation of dental ceramic material enhances its roughness, leading to the wear of the opposing natural tooth or restorative material, greater plaque attachment to ceramics, weakening of the ceramic structure causing the critical ion exchange… (More)
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex in all the other color classes. It is proved that with four exceptions, the b-chromatic number of cubic graphs is 4. The exceptions are the Petersen graph, K3,3, the prism over… (More)
Bite force is the condition, expression and measure of the masticatory function. The purpose of this study was to examine, by means of a newly constructed electronic gnathodynamometer, the values of maximal bite forces in subjects with complete dentition, the time in which they express 50% and 75% respectively of the total forces value, and the shape of the… (More)
Adresa za dopisivanje Prof.dr.sc. Jasenka Živko-Babić Sveučilište u Zagrebu Stomatološki fakultet Zavod za fiksnu protetiku Gundulićeva 5, 10000 Zagreb Tel: 01 4802 135 Faks: 01 4802 159 email@example.com Sažetak Posljednjih nekoliko desetljeća implantantno-protetička terapija sve se češće predlaže kod djelomice ozubljene čeljusti. Ugradnja implantata u… (More)