Geodesic
On the zero forcing number of graphs and their splitting graphs
Algebra and discrete mathematics, Tome 28 (2019) no. 1, pp. 29-43.

Voir la notice de l'article provenant de la source Math-Net.Ru

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(Γ).
Mots-clés : zero forcing number, splitting graph, path cover number and domination number of a graph. 
@article{ADM_2019_28_1_a2,
     author = {Baby Chacko and Charles Dominic and K. P. Premodkumar},
     title = {On the zero forcing number of graphs and their splitting graphs},
     journal = {Algebra and discrete mathematics},
     pages = {29--43},
     publisher = {mathdoc},
     volume = {28},
     number = {1},
     year = {2019},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/ADM_2019_28_1_a2/}
}
TY  - JOUR
AU  - Baby Chacko
AU  - Charles Dominic
AU  - K. P. Premodkumar
TI  - On the zero forcing number of graphs and their splitting graphs
JO  - Algebra and discrete mathematics
PY  - 2019
SP  - 29
EP  - 43
VL  - 28
IS  - 1
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/ADM_2019_28_1_a2/
LA  - en
ID  - ADM_2019_28_1_a2
ER  - 
%0 Journal Article
%A Baby Chacko
%A Charles Dominic
%A K. P. Premodkumar
%T On the zero forcing number of graphs and their splitting graphs
%J Algebra and discrete mathematics
%D 2019
%P 29-43
%V 28
%N 1
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/ADM_2019_28_1_a2/
%G en
%F ADM_2019_28_1_a2
Baby Chacko; Charles Dominic; K. P. Premodkumar. On the zero forcing number of graphs and their splitting graphs. Algebra and discrete mathematics, Tome 28 (2019) no. 1, pp. 29-43. https://geodesic-test.mathdoc.fr/item/ADM_2019_28_1_a2/

[1] D. Amos, Y. Caro, R. Davila, R. Pepper, “Upper bounds on the $k$-forcing number of a graph”, Discrete Appl. Math., 181 (2015), 1–10 | DOI | MR | Zbl

[2] Andries E. Brouwer, Willem H. Haemers, Spectra of graphs, Monograph, 2011 | MR

[3] D. Burgarth, V. Giovannetti, L. Hogben, S. Severini, M. Young, “Logic circuits from zeroforcing”, Natural Computing, 14 (201), 485–490 | DOI | MR | Zbl

[4] J. A. Gallian, “A Dynamic Survey of Graph Labeling”, Electronic J. Combinatorics, 2007, DS6, 1–58 | MR

[5] Hein van der Holst et al., “Zero forcing sets and the minimum rank of graphs”, Linear Algebra and its Applications, 428 (200), 1628–1648 | MR | Zbl

[6] L. Hogben, “Minimum rank problems”, Linear Algebra and its Applications, 432:8 (2010), 1961–1974 | DOI | MR | Zbl

[7] F.Harary, Graph Theory, Addison-Wesly, Massachusetts, 1969 | MR | Zbl

[8] D. D. Row, Zero forcing number: Results for computation and comparison with other graph parameters, Iowa State University, Ames, Iowa, 2011 | MR

[9] D. D. Row, “A technique for computing the zero forcing number of a graph with a cut vertex”, Linear Algebra and its Applications, 436 (201), 4423–4432 | DOI | MR | Zbl

[10] E. Sampathkumar and H. B. Walikaer, “On the splitting graph of a graph”, Journal of Karnatak University Science, 25 (198), 13–16 | Zbl

[11] E. Sampathkumar and H. B. Walikaer, “The connected domination number of a graph”, Jour. of Math. Phy. Sci., 13:6 (197), 607–613 | MR | Zbl