Premium
Degree Sums and Covering Cycles
Author(s) -
Enomoto Hikoe,
Kaneko Atsushi,
Kouider Mekkia,
Tuza Zsolt
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190200405
Subject(s) - combinatorics , mathematics , vertex (graph theory) , pairwise comparison , graph , simple graph , degree (music) , wheel graph , enhanced data rates for gsm evolution , simple (philosophy) , order (exchange) , discrete mathematics , graph power , line graph , statistics , computer science , telecommunications , philosophy , physics , epistemology , finance , acoustics , economics
Abstract It is shown that if in a simple graph G of order n the sum of degrees of any three pairwise non‐adjacent vertices is at least n , then there are two cycles (or one cycle and an edge or a vertex) of GF that contain all the vertices. © 1995 John Wiley & Sons, Inc.