a

Secure domination of some graph operators (Journal Article)

By: Contributor(s): Material type: TextTextSeries: Indian Journal of Pure and Applied Mathematics ; , Volume 54: Number 4, December 2023Publication details: New Delhi , 2023 :Description: 1170-1176pISSN:
  • 0019-5588
Subject(s): Online resources:
Contents:
***______{For Hard Copy, Please visit Library.}________***
Summary: Abstract: A set is said to be secure if the security condition, for every, holds. Now, a set is secure dominating if it is both secure and dominating. The secure domination number of G is the minimum cardinality of a secure dominating set in G. In this paper, we have obtained results regarding the secure domination number of some graph operators.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
Periodicals Periodicals RIE BPL Library Not for loan

***______{For Hard Copy, Please visit Library.}________***

Abstract: A set is said to be secure if the security condition, for every, holds. Now, a set is secure dominating if it is both secure and dominating. The secure domination number of G is the minimum cardinality of a secure dominating set in G. In this paper, we have obtained results regarding the secure domination number of some graph operators.

There are no comments on this title.

to post a comment.

Find us on the map

Contact Us

RIE Bhopal
Shyamla Hills
Bhopal
Madhya pradesh - 46003.
E-mail: library.riebpl@gmail.com
Phone: + 91 (0) 755 2522003

Powered by Koha