Premium
Two sufficient conditions for dominating cycles
Author(s) -
Lu Mei,
Liu Huiqing,
Tian Feng
Publication year - 2005
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.20070
Subject(s) - mathematics , backslash , combinatorics , graph , dominating set , cycle basis , discrete mathematics , graph power , line graph , vertex (graph theory)
A cycle C of a graph G is dominating if each component of $G\backslash C$ is edgeless. In the paper, we will give two sufficient conditions for each longest cycle of a 3‐connected graph to be a dominating cycle. © 2005 Wiley Periodicals, Inc. J Graph Theory
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom