Splices, Links, and their Edge-Degree Distances
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) and d(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,...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2017-12-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://toc.ui.ac.ir/article_21614_033f4714ff9a47c358a450a46e9a3122.pdf |