Properties and computational complexity of k-Isolate domination in graphs.

Saved in:
Bibliographic Details
Title: Properties and computational complexity of k-Isolate domination in graphs.
Authors: Vanitha, C.1 vanithasjsmv@gmail.com, Mutharasu, Sivagnanam2 skannaninunna@yahoo.com
Source: Nonlinear Studies. 2025, Vol. 32 Issue 3, p941-946. 6p.
Database: Academic Search Ultimate
Be the first to leave a comment!
You must be logged in first