Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
On the zero forcing number of graphs and their splitting graphs
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Chacko, B. | |
| dc.contributor.author | Dominic, C. | |
| dc.contributor.author | Premodkumar, K.P. | |
| dc.date.accessioned | 2023-03-02T15:16:34Z | |
| dc.date.available | 2023-03-02T15:16:34Z | |
| dc.date.issued | 2019 | |
| dc.identifier.citation | On the zero forcing number of graphs and their splitting graphs / B. Chacko, C. Dominic, K.P. Premodkumar // Algebra and Discrete Mathematics. — 2019. — Vol. 28, № 1. — С. 29–43. — Бібліогр.: 11 назв. — англ. | uk_UA |
| dc.identifier.issn | 1726-3255 | |
| dc.identifier.other | 2010 MSC: 05C50. | |
| dc.identifier.uri | http://dspace.nbuv.gov.ua/handle/123456789/188475 | |
| dc.description.abstract | In [10], the notion of the splitting graph of a graph was introduced. In this paper we compute the zero forcing number of the splitting graph of a graph and also obtain some bounds besides finding the exact value of this parameter. We prove for any connected graph Г of order n ≥ 2, Z[S(Г)] ≤ 2Z(Г) and also obtain many classes of graph in which Z[S(Г)] = 2Z(Г). Further, we show some classes of graphs in which Z[S(Г)] < 2Z(Г). | uk_UA |
| dc.description.sponsorship | We are very indebted to an anonymous referee for all of his/her corrections and suggestions which have improved this article a lot. | uk_UA |
| dc.language.iso | en | uk_UA |
| dc.publisher | Інститут прикладної математики і механіки НАН України | uk_UA |
| dc.relation.ispartof | Algebra and Discrete Mathematics | |
| dc.title | On the zero forcing number of graphs and their splitting graphs | uk_UA |
| dc.type | Article | uk_UA |
| dc.status | published earlier | uk_UA |
