Learn 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 that has a neighbor in each of the other color classes. We prove that every d-regular graph with at least 2d 3 vertices has b-chromatic number d + 1, that the b-chromatic number of an arbitrary d-regular(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)
OBJECTIVES The purpose of this research was to determine the mass concentrations of ions eluted from dental ceramic after an exposure to hydrochloric acid and, drawing on those results, to develop a feedforward backpropagation neural network (NN). MATERIALS AND METHODS Four dental ceramics were selected for this study. The experimental measurement was(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(More)