Biyofilik tasarım, pek çok disiplin tarafından ele alınan yeni, yönlü ve zengin bir yaklaşımdır. Bu disiplinlerden biri de mimarlık olup, insanın doğaya doğada bulunan canlılara karşı hissettiği doğuştan gelen içgüdüsel/duygusal bağın yarattığı yakınlığın mekânsal talepleri biçimlendirmesiyle ilgilenmektedir. Ekoloji sürdürülebilirlik konularıyla ilgili çalışmalara da referans olan biyofilik ya...

Let G be a simple graph with vertex set V(G) {v1,v2 ,...vn} . For every vertex i v , ( ) i  v represents the degree of vertex i v . The h-th order of Randić index, h R is defined as the sum of terms 1 2 1 1 ( ), ( )... ( ) i i ih  v  v  v  over all paths of length h contained (as sub graphs) in G . In this paper , some bounds for higher Randić index and a method for computing the higher R...

In this note, we derive the lower bound on the sum for Wiener index of bipartite graph and its bipartite complement, as well as the lower and upper bounds on this sum for the Randić index and Zagreb indices. We also discuss the quality of these bounds.

let $g$ be a simple connected graph. the edge-wiener index $w_e(g)$ is the sum of all distances between edges in $g$, whereas the hyper edge-wiener index $ww_e(g)$ is defined as {footnotesize $w{w_e}(g) = {frac{1}{2}}{w_e}(g) + {frac{1}{2}} {w_e^{2}}(g)$}, where {footnotesize $ {w_e^{2}}(g)=sumlimits_{left{ {f,g} right}subseteq e(g)} {d_e^2(f,g)}$}. in this paper, we present explicit formula fo...

Ines Pagel-Langenickel,* Daniel R. Schwartz,* Ross A. Arena, Diane C. Minerbi, D. Thor. Johnson, Myron A. Waclawiw, Richard O. Cannon III, Robert S. Balaban, Dorothy J. Tripodi, and Michael N. Sack Cardiology Branch, Laboratory of Cardiac Energetics and the Office of Biostatistics Research, National Heart, Lung, and Blood Institute, National Institutes of Health, Bethesda, Maryland; Department ...

Swingle [7]1 has given the following definitions. (1) A continuum M is said to be the finished sum of the continua of a collection G if G* = M and no continuum of G is a subset of the sum of the others.2 (2) If » is a positive integer, the continuum M is said to be indecomposable under index » if If is the finished sum of « continua and is not the finished sum of »+1 continua. Swingle has shown...

The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex farthest from v. In this paper we obtain the Wiener index of a graph in terms of eccentricities. Further we extend these results to the self-centered graphs.

The harmonic index H(G) , of a graph G is defined as the sum of weights 2/(deg(u)+deg(v)) of all edges in E(G), where deg (u) denotes the degree of a vertex u in V(G). In this paper we define the harmonic polynomial of G. We present explicit formula for the values of harmonic polynomial for several families of specific graphs and we find the lower and upper bound for harmonic index in Caterpill...