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 \(\Gamma\) of order \(n \ge 2\), \(...
Saved in:
| Date: | 2019 |
|---|---|
| Main Authors: | Chacko, Baby, Dominic, Charles, Premodkumar, K. P. |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2019
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/496 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
On the zero forcing number of graphs and their splitting graphs
by: Chacko, Baby, et al.
Published: (2019) -
On a graph isomorphic to its intersection graph: self-graphoidal graphs
by: Das, P. K., et al.
Published: (2019) -
On a graph isomorphic to its intersection graph: self-graphoidal graphs
by: Das, P. K., et al.
Published: (2019) -
Colour class domination numbers of some classes of graphs
by: Venkatakrishnan, Yanamandram B., et al.
Published: (2018) -
Colour class domination numbers of some classes of graphs
by: Venkatakrishnan, Yanamandram B., et al.
Published: (2018)