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...
Saved in:
| Date: | 2019 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2019
|
| Series: | Algebra and Discrete Mathematics |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/188475 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | 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 назв. — англ. |