Memorials to white explorers and pioneers long stood (virtually) unchallenged in the heart of Australia’s towns cities. By occupying civic space, they served legitimise narratives conquest dispossession, colonising minds same ways ‘settlers’ seized vast tracts territory. The focus this article is a memorial raised memory three explorers, ‘murdered’ (it was claimed) by ‘treacherous natives’ on n...

infantile hemiplegia refers to brain injuries that occur before or at birth and lead to hemiplegia/ total paralysis of one side of the body, including the face, arm and leg. the main purpose of this article is to provide valuable information to pediatric dentists about the review and treatment alternatives for patients with infantile hemiplegia. this article reports the case of a 12-year-old gi...

a flood warning system is a non-structural measure for flood mitigation. several parameters are responsible for flood related disasters. this work  illustrates an ordered intuitionistic fuzzy analysis that has the capability to simulate the unknown relations between a set of meteorological and hydrological parameters. in this paper, we first define ordered intuitionistic fuzzy soft sets and est...

let c be a field of subsets of a set i. also, let     1 i i be a non-decreasing positivesequence of real numbers such that 1, 1 0 1   i  and    11 i i . in this paper we prove thatbv of all the games of -bounded variation on c is a non-separable and norm dual banach space of thespace of simple games on c . we use this fact to establish the existence of a linear mapping t from...

a set $s$ of vertices in a graph $g$ is a dominating set if every vertex of $v-s$ is adjacent to some vertex in $s$. the domination number $gamma(g)$ is the minimum cardinality of a dominating set in $g$. the annihilation number $a(g)$ is the largest integer $k$ such that the sum of the first $k$ terms of the non-decreasing degree sequence of $g$ is at most the number of edges in $g$. in this p...

we denote by $ls[n](t,k,v)$ a large set of $t$-$(v,k,lambda)$ designs of size $n$, which is a partition of all  $k$-subsets ofa $v$-set into $n$ disjoint  $t$-$(v,k,lambda)$ designs and$n={v-t choose k-t}/lambda$.   we use the notation$n(t,v,k,lambda)$ as the maximum possible number of mutuallydisjoint cyclic $t$-$(v,k,lambda)$designs. in this paper we givesome new bounds for $n(2,29,4,3)$ and ...

the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...