An Implicit Weighted Degree Condition For Heavy Cycles

An Implicit Weighted Degree Condition For Heavy Cycles

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;...

Full description

Bibliographic Details
Main Authors: Cai Junqing, Li Hao, Ning Wantao
Format: Article
Language:English
Published: University of Zielona Góra 2014-11-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
weighted graph
hamiltonian cycles
heavy cycles
implicit degree
implicit weighted degree
Online Access:https://doi.org/10.7151/dmgt.1762

Internet

https://doi.org/10.7151/dmgt.1762

Similar Items