Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

An Implicit Weighted Degree Condition For Heavy Cycles

Junqing CaiHao LiWantao Ning — 2014

Discussiones Mathematicae Graph Theory

For a vertex v in a weighted graph G, idw(v) denotes the implicit weighted degree of v. In this paper, we obtain the following result: Let G be a 2-connected weighted graph which satisfies the following conditions: (a) The implicit weighted degree sum of any three independent vertices is at least t; (b) w(xz) = w(yz) for every vertex z ∈ N(x) ∩ N(y) with xy /∈ E(G); (c) In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight. Then G contains...

Page 1

Download Results (CSV)