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: | Wang Yijin, Zhang Xinyue, Zhang Sijia |
---|---|
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 |
Similar Items
-
Feedback Numbers of Goldberg Snark, Twisted Goldberg Snarks and Related Graphs
by: Zhang Xinyue, et al.
Published: (2019-01-01) -
Sharp bounds for partition dimension of generalized Möbius ladders
by: Hussain Zafar, et al.
Published: (2018-11-01) -
Arithmetical properties of double Möbius-Bernoulli numbers
by: Bayad Abdelmejid, et al.
Published: (2019-02-01) -
Rank numbers for bent ladders
by: Richter Peter, et al.
Published: (2014-05-01) -
Möbius syndrome
by: Sameer Vyas, et al.
Published: (2016-04-01)