IJPAM: Volume 93, No. 4 (2014)
FEEDBACK NUMBERS OF FLOWER SNARK
AND RELATED GRAPHS
AND RELATED GRAPHS
Sijia Zhang
, Xirong Xu
, Cong Liu
, Yuansheng Yang
School of Computer Science and Technology
Dalian University of Technology
Dalian, 116024, P.R. CHINA




School of Computer Science and Technology
Dalian University of Technology
Dalian, 116024, P.R. CHINA
Abstract. A subset of vertices of a graph is called a feedback vertex set of
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 investigate the feedback number of flower snark and related graphs
. Let
denote the feedback number of
, we prove that

Received: January 7, 2014
AMS Subject Classification: 05C85, 68R10
Key Words and Phrases: feedback vertex set, feedback number, flower snark, acyclic subgraph, bipartite subgraph
Download paper from here.
DOI: 10.12732/ijpam.v93i4.5 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2014
Volume: 93
Issue: 4
Pages: 541 - 547
