On the zero forcing number of graphs and their splitting graphs

Title

On the zero forcing number of graphs and their splitting graphs

Creator

Chacko B.; Dominic C.; Premodkumar K.P.; Simson D.

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(?). Journal Algebra and Discrete Mathematics.

Source

Algebra and Discrete Mathematics, Vol-28, No. 1, pp. 29-43.

Date

2019-01-01

Publisher

Lugansk Taras Shevchenko National University

Subject

Path cover number and domination number of a graph; Splitting graph; Zero forcing number

Coverage

Chacko B., P.G Department, Research Center of Mathematics, St. Josephs College, Devagiri, Calicut, Kerala, India; Dominic C., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, Karnataka, India; Premodkumar K.P., P.G Department, Research Center of Mathematics, St. Josephs College, Devagiri, Calicut, Kerala, India; Simson D.

Rights

Restricted Access

Relation

ISSN: 17263255

Format

Online

Language

English

Type

Article

Identifier

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85071428634&partnerID=40&md5=d649d755eafd7a7a58292aa3cbb64e75