z-logo
open-access-imgOpen Access
Connected Edge Litact Domination in Graphs
Author(s) -
M. Vani,
Abdul Majeed,
J. Vasundhara Devi
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.k1835.0981119
Subject(s) - enhanced data rates for gsm evolution , dominating set , combinatorics , domination analysis , graph , mathematics , computer science , artificial intelligence , vertex (graph theory)
A subset of edges dominating in is connected edge dominating, if , the subgraph induced by is connected.The connected edge litact domination number , is .In This article we could able to bring up some interesting results on connected edge litact domination number of graph with its parameters and some domination parameters. Subject classification number: AMS-05C69, 05C70.

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