A class is an e ectively closed set of reals We study properties of these classes determined by cardinality measure and category as well as by the complexity of the members of a class P Given an e ective enumeration fPe e g of the classes the index set I for a certain property such as having positive measure is the set of indices e such that Pe has the property For example the index set of bina...

For a graph G = (V,E) with a binary vertex coloring f : V (G)→ Z2, let vf (i) = |f−1(i)|. We say f is friendly if |vf (1) − vf (0)| ≤ 1, i.e., the number of vertices labeled 1 is the same or almost the same as the number of vertices labeled 0. The coloring f induces an edge labeling f ∗ : E(G) → Z2 defined by f ∗(uv) = f(u) + f(v) (mod 2), for each uv ∈ E(G). Let ef (i) = |{uv ∈ E(G) : f ∗(uv) ...

This study aims to measure age-friendliness based on the walkability indices of older people urban facilities in sample area Istanbul, Turkey and various districts within. It focuses three key age-friendly cities: open public spaces, health services basic needs; Quantitative datasets are also utilised order environment. There two main quantitative dimensions study: generate accessible areas ide...

A symmetric m×m matrix M with entries taken from {0, 1, ∗} gives rise to a graph partition problem, asking whether a graph can be partitioned into m vertex sets matched to the rows (and corresponding columns) of M such that, if Mij = 1, then any two vertices between the corresponding vertex sets are joined by an edge, and if Mij = 0 then any two vertices between the corresponding vertex sets ar...