Throughout this paper a graph G is assumed to be simple, i.e. a finite undirected graph without loops or multiple edges. Therefore, the characteristic polynomial of (the adjacency matrix of) G,â€¦ (More)

A simple graph is reflexive if its second largest eigenvalue Î»2 is less than or equal to 2. A graph is a cactus, or a treelike graph, if any pair of its cycles (circuits) has at most one commonâ€¦ (More)

Biomedical papers of the Medical Faculty of theâ€¦

2012

AIM
The purpose of the study was to evaluate the influence of four comorbidities from the Cumulative Illness Rating Scale for Geriatrics (CIRS-G) and their severity on functional status outcome afterâ€¦ (More)

The spectrum of a graph is the family of eigenvalues of its (0, 1) adjacency matrix. A simple graph is reflexive if its second largest eigenvalue 2 does not exceed 2. The graphic property 2 2 is aâ€¦ (More)

INTRODUCTION
The aim of the study was to evaluate motor functional status measured by motor Functional Independence Measure (mFIM) test in population above 65 years of age after the hip fracture.
â€¦ (More)

AIM
To evaluate the functional status measured by Berg Balance Scale (BBS) in elderly aged more than 65 years after hip fractures, and to evaluate the influence of sex, age and comorbidity on balanceâ€¦ (More)

If G is a simple graph (a non-oriented graph without loops or multiple edges), its (0, 1)-adjacency matrix A is symmetric and roots of the characteristic polynomial PG (Î») = det (Î»I âˆ’ A) (theâ€¦ (More)