| Issue |
ITM Web Conf.
Volume 25, 2019
2018 3rd International Conference on Intelligent Computing and Cognitive Informatics (ICICCI 2018)
|
|
|---|---|---|
| Article Number | 01012 | |
| Number of page(s) | 6 | |
| Section | Intelligent Computing | |
| DOI | https://doi.org/10.1051/itmconf/20192501012 | |
| Published online | 01 February 2019 | |
Feedback Numbers of Goldberg Snark, Twisted Goldberg Snarks and Related Graphs
School of Information Engineering, Dalian Ocean University, Dalian, 116023, China
a Corresponding author: zhangsijia@dlou.edu.cn
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.
© The Authors, published by EDP Sciences, 2019
This is an open access article distributed under the terms of the Creative Commons Attribution License 4.0 (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.