|
|
|
|
splices, links, and their edgedegree distances
|
|
|
|
|
|
|
|
نویسنده
|
azari mahdieh ,divanpour hojjatollah
|
|
منبع
|
transactions on combinatorics - 2017 - دوره : 6 - شماره : 4 - صفحه:29 -42
|
|
چکیده
|
The edge-degree distance of a simple connected graph g is defined as the sum of the terms(d(e|g)+d(f|g))d(e,f|g) over all unordered pairs {e,f} of edges of g, where d(e|g) andd(e,f|g) denote the degree of the edge e in g and the distance between the edges e and f in g, respectively. in this paper, we study the behavior of two versions of the edge-degree distance under two graph products called splice and link.
|
|
کلیدواژه
|
distance ,degree ,edge-degree distance ,splice of graphs ,link of graphs
|
|
آدرس
|
islamic azad university, kazerun branch, department of mathematics, ایران, technical and vocational university, shiraz technical college, department of science, ایران
|
|
پست الکترونیکی
|
h.divanpour@yahoo.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|