Feedback Numbers of Möbius Ladders
A subset F ⊂ V(G) is called a feedback vertex set if the subgraph G−F is acyclic. The minimum cardinality of a feedback vertex set is called the feedback number of G, which is proposed by Beineke and Vandell [1]. In this paper, we consider a particular topology graph called Möbius ladders M2n. We us...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2019-01-01
|
Series: | ITM Web of Conferences |
Online Access: | https://www.itm-conferences.org/articles/itmconf/pdf/2019/02/itmconf_icicci2018_01013.pdf |
id |
doaj-7ccd98e119b14ebcb69c6a135d2a491f |
---|---|
record_format |
Article |
spelling |
doaj-7ccd98e119b14ebcb69c6a135d2a491f2021-02-02T01:30:44ZengEDP SciencesITM Web of Conferences2271-20972019-01-01250101310.1051/itmconf/20192501013itmconf_icicci2018_01013Feedback Numbers of Möbius LaddersWang Yijin0Zhang Xinyue1Zhang Sijia2School of Information Engineering, Dalian Ocean UniversitySchool of Information Engineering, Dalian Ocean UniversitySchool of Information Engineering, Dalian Ocean UniversityA subset F ⊂ V(G) is called a feedback vertex set if the subgraph G−F is acyclic. The minimum cardinality of a feedback vertex set is called the feedback number of G, which is proposed by Beineke and Vandell [1]. In this paper, we consider a particular topology graph called Möbius ladders M2n. We use f(M2n) to denote the feedback number of M2n. This paper proves that f (M2n) = [n+1/2], n≥3.https://www.itm-conferences.org/articles/itmconf/pdf/2019/02/itmconf_icicci2018_01013.pdf |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Wang Yijin Zhang Xinyue Zhang Sijia |
spellingShingle |
Wang Yijin Zhang Xinyue Zhang Sijia Feedback Numbers of Möbius Ladders ITM Web of Conferences |
author_facet |
Wang Yijin Zhang Xinyue Zhang Sijia |
author_sort |
Wang Yijin |
title |
Feedback Numbers of Möbius Ladders |
title_short |
Feedback Numbers of Möbius Ladders |
title_full |
Feedback Numbers of Möbius Ladders |
title_fullStr |
Feedback Numbers of Möbius Ladders |
title_full_unstemmed |
Feedback Numbers of Möbius Ladders |
title_sort |
feedback numbers of möbius ladders |
publisher |
EDP Sciences |
series |
ITM Web of Conferences |
issn |
2271-2097 |
publishDate |
2019-01-01 |
description |
A subset F ⊂ V(G) is called a feedback vertex set if the subgraph G−F is acyclic. The minimum cardinality of a feedback vertex set is called the feedback number of G, which is proposed by Beineke and Vandell [1]. In this paper, we consider a particular topology graph called Möbius ladders M2n. We use f(M2n) to denote the feedback number of M2n. This paper proves that f (M2n) = [n+1/2], n≥3. |
url |
https://www.itm-conferences.org/articles/itmconf/pdf/2019/02/itmconf_icicci2018_01013.pdf |
work_keys_str_mv |
AT wangyijin feedbacknumbersofmobiusladders AT zhangxinyue feedbacknumbersofmobiusladders AT zhangsijia feedbacknumbersofmobiusladders |
_version_ |
1724311656621670400 |