نتایج جستجو برای: distance in graphs

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

Journal: :transactions on combinatorics 2011
m. tavakoli h. yousefi-azari ali reza ashrafi

edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.

ژورنال: محاسبات نرم 2016

Let G=(V,E) be a graph where v(G) and E(G) are vertices and edges of G, respectively. Sum of distance between vertices of graphs is called wiener invariant. In This paper, we present some proved results on the wiener invariant and some new result on the upper bound of wiener invariant of k-connected graphs.

Journal: :Journal of Combinatorial Theory, Series B 1986

Journal: :Discrete & Computational Geometry 2004

Journal: :Journal of Combinatorial Theory 1969

Journal: :The Electronic Journal of Combinatorics 2016

Journal: :European Journal of Combinatorics 1986

Journal: :Graphs and Combinatorics 2019

Journal: :Linear and Multilinear Algebra 1995

Journal: :iranian journal of mathematical chemistry 0
m. k. jamil abdus salam school of mathematical sciences, government college university, lahore, pakistan.

let $g$ be a connected graph, and let $d[g]$ denote the double graph of $g$. in this paper, we first derive closed-form formulas for different distance based topological indices for $d[g]$ in terms of that of $g$. finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

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

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