BACKGROUND Variations associated with sex, age, velocity, breed and body geometry should be considered in the determination of kinematic parameters for a gait considered normal. Therefore, this study aimed to evaluate kinematic patterns of forelimbs and hind limbs in clinically normal sheep from two different age groups walking at a constant velocity. The hypothesis was that the age may influen...

The super edge-connectivity λ′ of a connected graph G is the minimum cardinality of an edge-cut F in G such that every component of G − F contains at least two vertices. LetGi be a connected graph with order ni , minimum degree δi and edge-connectivity λi for i = 1, 2. This article shows that λ′(G1 × G2) ≥ min{n1 λ2,n2 λ1,λ1 + 2λ2, 2λ1+λ2} forn1,n2 ≥ 3 andλ′(K2×G2) = min{n2, 2λ2}, which general...

The strong product G1 £G2 of graphs G1 and G2 is the graph with V (G1) × V (G2) as the vertex set, and two distinct vertices (x1, x2) and (y1, y2) are adjacent whenever for each i ∈ {1, 2} either xi = yi or xiyi ∈ E(Gi). In this note we show that for two connected graphs G1 and G2 the edge-connectivity λ(G1£G2) equals min{δ(G1£ G2), λ(G1)(|V (G2)|+2|E(G2)|), λ(G2)(|V (G1)|+2|E(G1)|)}. In additi...

conclusions the ppi-g2 dendrimer with end amine groups exhibited a positive impact on the removal of dominant bacterial isolated strains. therefore, it is possible to use these nanodendrimers as a safe and effective material for water disinfection in the future. results the most important isolated bacteria were escherichia coli 37 (48.7%), klebsiella oxytoca 12 (15.8%), proteus mirabilis 3 (4%)...

This paper determines that the connectivity of the Cartesian product G1 G2 of two graphs G1 and G2 is equal to min{κ1v2, κ2v1, δ1 + δ2}, where vi, κi, δi is the order, the connectivity and the minimum degree of Gi, respectively, for i = 1, 2, and gives some necessary and sufficient conditions for G1 G2 to be maximally connected and super-connected.

Expanding on a recent definition by Bialostocki and Voxman, we define the rainbow ramsey number RR(G1, G2) of two graphs G1 and G2 to be the minimum integer N such that any edge-coloring of the complete graph KN with any number of colors must contain either a copy of G1 with every edge the same color or a copy of G2 with every edge a different color. This number is well-defined if G1 is a star ...

Introduction Due to increased life expectancy among the population, studying the vocal parameters of the elderly is key to promoting vocal health in old age. Objective This study aims to analyze the profile of the extension of speech of elderly female choristers, according to age group. Method The study counted on the participation of 25 elderly female choristers from the Choir of Messianic Chu...

A set of vertices W resolves a graph G if every vertex of G is uniquely determined by its vector of distances to the vertices in W . The metric dimension for G, denoted by dim(G), is the minimum cardinality of a resolving set of G. In order to study the metric dimension for the hierarchical product G2 2 uG1 1 of two rooted graphs G2 2 and G u1 1 , we first introduce a new parameter, the rooted ...

The (G1,G2)-online Ramsey game is a two-player turn-based between builder and painter. Starting from an empty graph with infinite vertices, the adds new edge in each round, painter colors it red or blue. aims to force either copy of G1 blue G2 as few rounds possible, while painter’s aim opposite. online number r˜(G1,G2) minimum edges that needs win game, regardless strategy. Furthermore, we ini...