z-logo
open-access-imgOpen Access
Strong Split Litact Domination in Graphs
Author(s) -
A.Renuka Lakshmi,
Abdul Majeed,
J.Vasundhara Devi
Publication year - 2019
Publication title -
international journal of recent technology and engineering (ijrte)
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.c3924.098319
Subject(s) - limiting , graph , combinatorics , domination analysis , mathematics , discrete mathematics , computer science , engineering , vertex (graph theory) , mechanical engineering
In this paper the strong split litact domination number of some standard graphs like Cycle graph , wheel graph , Complete graph , Bi-partite graph etc., are calculated and tried to bring up the relationship between the with different limiting factors of and also with other domination limiting factors of .

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom