It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
A subset of vertices of a graph G is called a feedback vertex set of G if its removal results in an acyclic subgraph. The minimum cardinality of a feedback vertex set is called the feedback number. In this paper, we determine the exact values of the feedback numbers of the Goldberg snarks Gn and its related graphs Gn*, Twisted Goldberg Snarks TGn and its related graphs TGn*. Let f(n) denote the feedback numbers of these graphs, we prove that f(n)=2n+1, for n≥3.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer