نتایج جستجو برای: tchebychev distance

تعداد نتایج: 238300  

Journal: :transactions on combinatorics 2015
r. b. bapat sivaramakrishnan sivasubramanian

let $a = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrixwhere $n geq 2$. let $dt(a)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$. let $g$ be a connected graph with blocks $b_1, b_2, ldots b_p$ and with$q$-exponential distance matrix $ed_g$. we given an explicitformula for $dt(ed_g)$ which shows that $dt(ed_g)$ is independent of the manner in ...

Journal: :Environment-Behaviour Proceedings Journal 2016

Journal: :Australasian Journal of Educational Technology 1985

Journal: :International Journal of Fuzzy Logic and Intelligent Systems 2012

Journal: :Discussiones Mathematicae Graph Theory 2019

Journal: :Journal of Combinatorial Theory, Series A 2013

Journal: :The Electronic Journal of Combinatorics 2007

Journal: :نظریه تقریب و کاربرد های آن 0
لیلا قلی زاده دانشگاه آزاد واحد علوم و تحقیقات تهران

we consider the concept of ω-distance on a complete partially ordered g-metric space and prove some common fi xed point theorems.

Journal: :transactions on combinatorics 2016
yaoping mao zhao wang ivan gutman

the wiener index $w(g)$ of a connected graph $g$‎ ‎is defined as $w(g)=sum_{u,vin v(g)}d_g(u,v)$‎ ‎where $d_g(u,v)$ is the distance between the vertices $u$ and $v$ of‎ ‎$g$‎. ‎for $ssubseteq v(g)$‎, ‎the {it steiner distance/} $d(s)$ of‎ ‎the vertices of $s$ is the minimum size of a connected subgraph of‎ ‎$g$ whose vertex set is $s$‎. ‎the {it $k$-th steiner wiener index/}‎ ‎$sw_k(g)$ of $g$ ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید