The aim of the paper is to introduce an approach for evaluating integrated remediation and landfill mining scenarios. Since completed projects with similar scope and goals mostly have been pilot studies or projects with little emphasis on resource extraction, there is very little real case data to access. Thus, scenarios for three different routes have been established: Remediation only; Remedi...

There is considerable debate about the effects of today’s family structures on support arrangements for older people. Using representative data from The Netherlands, the study reported in this paper investigates which sociodemographic characteristics of adult children and their elderly parents, and which motivations of the adult children, correlate with children giving practical and social supp...

Assessment of Separation Distances to Avoid Odour Annoyance: Interaction Between Odour Impact Criteria and Peak-to-Mean Factors Günther Schauberger*, Martin Piringer WG Environmental Health, University of Veterinary Medicine Vienna, A1210 Vienna. Veterinärplatz 1, Austria Central Institute of Meteorology and Geodynamics, Vienna, A 1190 Vienna, Hohe Warte 38, Austria *gunther.schauberger@vetmedu...

Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...

We prove several new sufficient conditions for hamiltonicity and bipancyclicity in balanced bipartite digraphs, terms of sums degrees over dominating or dominated pairs vertices.

A 2-distance coloring of a graph is a coloring of the vertices such that two vertices at distance at most 2 receive distinct colors. We prove that every graph with maximum degree Δ at least 4 and maximum average degree less that 73 admits a 2-distance (Δ + 1)-coloring. This result is tight. This improves previous known results of Dolama and Sopena.

2.2 Distance between Two Vertices The distance between two vertices u and v is defined as the length of the shortest path connecting them. Remark 1. The number of paths connecting two vertices could be exponential. As shown in the below illustration, there are around 3 ”blocks” to choose from given that there are n vertices in total and each block takes around 3 vertices. The number of paths av...

Let Pn be the path graph on n vertices. In this paper, we consider the distance graphs G(Pn, D), where the distance set D ⊆ {1, 2, 3, . . . , n− 1}. We characterize the distance set D for which G(Pn, D) is one of path, cycle, wheel, regular, bipartite, acyclic, Cr-free, K1,r-free, or having isolated vertices.

We analyze three-body decays of and . Under the factorization approach, there are tree level diagrams for these decay modes and the transition matrix element of decay is factorized into a form factor multiplied by decay constant and form factor multiplied into weak vertices form factor. The transition matrix element of decay is also factorized into a form factor multiplied into weak vertic...