scientific article
From MaRDI portal
Publication:3895508
zbMath0449.05057MaRDI QIDQ3895508
H. B. Walikar, E. Sampathkumar
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (84)
Chromatic connected domination in graphs ⋮ A new approach on locally checkable problems ⋮ Greedy approximation for the minimum connected dominating set with labeling ⋮ An improved binary programming formulation for the secure domination problem ⋮ Line domination in graphs ⋮ Strong weak domination and domination balance in a graph ⋮ Dominating sets whose closed stars form spanning trees ⋮ On the forcing connected domination number of a graph ⋮ Triple connected two out degree equitable domination number ⋮ Making a dominating set of a graph connected ⋮ Bounds for the connected domination number of maximal outerplanar graphs ⋮ The e-mail gossip number and the connected domination number ⋮ Traceability of connected domination critical graphs ⋮ Nordhaus-Gaddum inequalities for domination in graphs ⋮ NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs ⋮ Categorifying connected domination via graph überhomology ⋮ Tadpole domination number of graphs ⋮ Connected domination in maximal outerplanar graphs ⋮ Extended formulations for perfect domination problems and their algorithmic implications ⋮ Spanning Trees and Domination in Hypercubes ⋮ Domination parameters of a graph and its complement ⋮ Connected power domination in graphs ⋮ Correlation of domination parameters with physicochemical properties of octane isomers ⋮ On connected co-independent domination in the join, corona and lexicographic product of graphs ⋮ Dominating complex networks by identifying minimum skeletons ⋮ Partially composed property of generalized lexicographic product graphs ⋮ Improper C-colorings of graphs ⋮ Open global shadow graph and it’s zero forcing number ⋮ CO-EVEN HUB NUMBER OF A GRAPH ⋮ Domination in edge cycle graphs ⋮ Independence and domination in divisor graph and mod-difference graphs ⋮ Bipartite leaderless synchronization of fractional-order coupled neural networks via edge-based adaptive pinning control ⋮ Independence and inverse domination in complete z-ary tree and Jahangir graphs ⋮ Connected Fair Domination in Graphs ⋮ On graphs with equal dominating and c-dominating energy ⋮ Bounds on 2-point set domination number of a graph ⋮ Vertex coloring without large polychromatic stars ⋮ PBIB-designs and association schemes arising from minimum bi-connected dominating sets of some special classes of graphs ⋮ Unnamed Item ⋮ On the Structure of Graphs Vertex Critical with Respect to Connected Domination ⋮ 2-(edge-)connected edge domination number and matching number ⋮ \(H\)-domination in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Unnamed Item ⋮ Wireless networking, dominating and packing ⋮ On dominating sets whose induced subgraphs have a bounded diameter ⋮ Bounds on the connected domination number of a graph ⋮ Unnamed Item ⋮ On the semitotal domination number of line graphs ⋮ The bottleneck independent domination on the classes of bipartite graphs and block graphs. ⋮ The least point covering and domination numbers of a graph ⋮ Connected domination number of a graph and its complement ⋮ Domination in 4-regular Knödel graphs ⋮ Dominating and large induced trees in regular graphs ⋮ Matching properties in connected domination critical graphs ⋮ Connected domination critical graphs with a block having maximum number of cut vertices ⋮ Convex and isometric domination of (weak) dominating pair graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Complexity and computation of connected zero forcing ⋮ Connected domination critical graphs with respect to relative complements ⋮ On the doubly connected domination number of a graph ⋮ Unnamed Item ⋮ New results on connected dominating structures in graphs ⋮ Routing sets in the integer lattice ⋮ 2-edge connected dominating sets and 2-connected dominating sets of a graph ⋮ Connected Domatic Number in Planar Graphs ⋮ Semicomplete absorbent sets in digraphs ⋮ Domination-related parameters in rooted product graphs ⋮ Synchronization of complex-valued dynamic networks with intermittently adaptive coupling: a direct error method ⋮ Connected domination value in graphs ⋮ Unnamed Item ⋮ Strong vb-dominating and vb-independent sets of a graph ⋮ Connected Domination ⋮ CONNECTED dr-POWER DOMINATING SETS IN GRAPHS ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ Relating the size of a connected graph to its total and restricted domination numbers ⋮ A proof of a conjecture on the connected domination number ⋮ The minimum eccentric distance sum of trees with given distance k-domination number ⋮ A note on connected domination number and leaf number ⋮ Connected monophonic domination in graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ Tractable connected domination for restricted bipartite graphs ⋮ Connected domination game
This page was built for publication:
