On the zero forcing number of graphs and their splitting graphs
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(Г) a...
Gespeichert in:
| Veröffentlicht in: | Algebra and Discrete Mathematics |
|---|---|
| Datum: | 2019 |
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | Englisch |
| Veröffentlicht: |
Інститут прикладної математики і механіки НАН України
2019
|
| Online Zugang: | https://nasplib.isofts.kiev.ua/handle/123456789/188475 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Zitieren: | 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 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1862746316154601472 |
|---|---|
| author | Chacko, B. Dominic, C. Premodkumar, K.P. |
| author_facet | Chacko, B. Dominic, C. Premodkumar, K.P. |
| citation_txt | 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 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| description | 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(Г).
|
| first_indexed | 2025-12-07T20:44:30Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-188475 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-12-07T20:44:30Z |
| publishDate | 2019 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Chacko, B. Dominic, C. Premodkumar, K.P. 2023-03-02T15:16:34Z 2023-03-02T15:16:34Z 2019 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 назв. — англ. 1726-3255 2010 MSC: 05C50. https://nasplib.isofts.kiev.ua/handle/123456789/188475 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(Г). We are very indebted to an anonymous referee for all of his/her corrections and suggestions which have improved this article a lot. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics On the zero forcing number of graphs and their splitting graphs Article published earlier |
| spellingShingle | On the zero forcing number of graphs and their splitting graphs Chacko, B. Dominic, C. Premodkumar, K.P. |
| title | On the zero forcing number of graphs and their splitting graphs |
| title_full | On the zero forcing number of graphs and their splitting graphs |
| title_fullStr | On the zero forcing number of graphs and their splitting graphs |
| title_full_unstemmed | On the zero forcing number of graphs and their splitting graphs |
| title_short | On the zero forcing number of graphs and their splitting graphs |
| title_sort | on the zero forcing number of graphs and their splitting graphs |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/188475 |
| work_keys_str_mv | AT chackob onthezeroforcingnumberofgraphsandtheirsplittinggraphs AT dominicc onthezeroforcingnumberofgraphsandtheirsplittinggraphs AT premodkumarkp onthezeroforcingnumberofgraphsandtheirsplittinggraphs |