Degree Equitable Connected cototal dominating graph
نویسندگان
چکیده
منابع مشابه
Connected Cototal Domination Number of a Graph
A dominating setD ⊆ V of a graphG = (V,E) is said to be a connected cototal dominating set if 〈D〉 is connected and 〈V −D〉 6= ∅, contains no isolated vertices. A connected cototal dominating set is said to be minimal if no proper subset of D is connected cototal dominating set. The connected cototal domination number γccl(G) of G is the minimum cardinality of a minimal connected cototal dominati...
متن کاملconnected cototal domination number of a graph
a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...
متن کاملEditing to Connected f-Degree Graph
In the Edge Editing to Connected f-Degree Graph problem we are given a graph G, an integer k and a function f assigning integers to vertices of G. The task is to decide whether there is a connected graph F on the same vertex set as G, such that for every vertex v, its degree in F is f(v) and the number of edges in E(G)4E(F ), the symmetric difference of E(G) and E(F ), is at most k. We show tha...
متن کاملConnected Dominating Sets
PROBLEM DEFINITION Consider a graph G = (V,E). A subset C of V is called a dominating set if every vertex is either in C or adjacent to a vertex in C. If, furthermore, the subgraph induced by C is connected, then C is called a connected dominating set. A connected dominating set with a minimum cardinality is called a minimum connected dominating set (MCDS). Computing a MCDS is an NP-hard proble...
متن کاملConnected Dominating Sets
Wireless sensor networks (WSNs), consist of small nodes with sensing, computation, and wireless communications capabilities, are now widely used in many applications, including environment and habitat monitoring, traffic control, and etc. Routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks like mobile ad hoc networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Mathematics
سال: 2017
ISSN: 2319-765X,2278-5728
DOI: 10.9790/5728-1301010408