On the k-Forcing Number of Some DS-Graphs

Title

On the k-Forcing Number of Some DS-Graphs

Creator

Raksha M.R.; Dominic C.

Description

Amos et al. introduced the notion of k-forcing number as a generalization of Zero forcing number and is denoted by Fk(G) where k> 0 is any positive integer, the k -forcing number of a graph is the minimum cardinality among all k -forcing sets of a graph G. In this paper, many bounds for k -forcing number of degree splitting graph DS(G) for different graph classes are found. We evaluate the value of k -forcing number of degree splitting graph of some of the Cartesian product graph for different values of k. Also we observed that for Tur graph Tn , t, upper and lower bound is given by, Fk(Tn , t) ? Fk(DS(Tn , t) ) ? Fk(Tn , t) + 1. 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

Source

Lecture Notes in Networks and Systems, Vol-290, pp. 394-402.

Date

2021-01-01

Publisher

Springer Science and Business Media Deutschland GmbH

Subject

Degree splitting graph; k-forcing number; Regular graph; Tur graph

Coverage

Raksha M.R., Department of Mathematics, CHRIST(Deemed to be University), Bangalore, India; Dominic C., Department of Mathematics, CHRIST(Deemed to be University), Bangalore, India

Rights

Restricted Access

Relation

ISSN: 23673370; ISBN: 978-981164485-6

Format

Online

Language

English

Type

Conference paper

Identifier

https://doi.org/10.1007/978-981-16-4486-3_44

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85115067467&doi=10.1007%2f978-981-16-4486-3_44&partnerID=40&md5=ddd74db0c1108e5a1efc6abb6573a084