Independent domination in graphs: A survey and recent results
From MaRDI portal
Publication:1942046
DOI10.1016/j.disc.2012.11.031zbMath1260.05113OpenAlexW2077326803MaRDI QIDQ1942046
Michael A. Henning, Wayne Goddard
Publication date: 15 March 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.11.031
Related Items (only showing first 100 items - show all)
On the 2-rainbow independent domination numbers of some graphs ⋮ On the complexity of minimum maximal acyclic matchings ⋮ 2-Point set domination in separable graphs ⋮ Common domination perfect graphs ⋮ Domination, independent domination and \(k\)-independence in trees ⋮ Independent domination in directed graphs ⋮ A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two ⋮ Construction of Halin graph with perfect k-ary tree and its independent domination number ⋮ On independent domination parameters of some special families of Halin graph ⋮ Integer linear programming formulations for double roman domination problem ⋮ The domination number and the least \(Q\)-eigenvalue ⋮ On upper transversals in 3-uniform hypergraphs ⋮ Graph products of the trivariate total domination polynomial and related polynomials ⋮ Minimum maximal matchings in cubic graphs ⋮ Completion and decomposition of hypergraphs into dominating sets of graphs ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ New results relating independence and matchings ⋮ New bounds on the independence number of connected graphs ⋮ Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage ⋮ Independent Domination in Cubic Graphs ⋮ A Taxonomy of Perfect Domination ⋮ ON WEAK DOMINATION NUMBER OF SOME GRAPHS ⋮ Decreasing the maximum degree of a graph ⋮ Simultaneously dominating all spanning trees of a graph ⋮ A linear-time algorithm for weighted paired-domination on block graphs ⋮ On the total and strong version for Roman dominating functions in graphs ⋮ Isolation of cycles ⋮ NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs ⋮ Independent domination in subcubic graphs of girth at least six ⋮ Domination versus independent domination in graphs of small regularity ⋮ Isolation of \(k\)-cliques ⋮ Independent domination, colorings and the fractional idomatic number of a graph ⋮ On independent domination of regular graphs ⋮ \( P_5\)-isolation in graphs ⋮ Domination versus independent domination in regular graphs ⋮ Independent rainbow domination of graphs ⋮ On independent domination in direct products ⋮ A tight bound for independent domination of cubic graphs without 4‐cycles ⋮ Smallest maximal matchings of graphs ⋮ Extended formulations for perfect domination problems and their algorithmic implications ⋮ On \(\alpha\)-excellent graphs ⋮ On upper bounds for the independent transversal domination number ⋮ On maximal partial Latin hypercubes ⋮ Closed formulas for the independent (Roman) domination number of rooted product graphs ⋮ Semidistrim Lattices ⋮ The max-out min-in problem: a tool for data analysis ⋮ Semi Square Stable Graphs and Efficient Dominating Sets ⋮ Exact capacitated domination: on the computational complexity of uniqueness ⋮ Density of the cototal enumeration degrees ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Unnamed Item ⋮ On the independent domination polynomial of a graph ⋮ Semitotal domination in claw-free cubic graphs ⋮ Unnamed Item ⋮ An improved lower bound on the independence number of a graph ⋮ Changing and unchanging of the domination number of a graph: path addition numbers ⋮ General upper bounds on independent \(k\)-rainbow domination ⋮ Independent domination number in Cayley digraphs of rectangular groups ⋮ \( K_{1 , 2}\)-isolation in graphs ⋮ Independent feedback vertex set for \(P_5\)-free graphs ⋮ Independent sets in graphs ⋮ Bounds on the independence number of a graph in terms of order, size and maximum degree ⋮ Unnamed Item ⋮ Independent domination in bipartite cubic graphs ⋮ A note on some parameters of domination on the edge neighborhood graph of a graph ⋮ The \(v\)-number of edge ideals ⋮ Interactive natural language question answering over knowledge graphs ⋮ Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs ⋮ Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games ⋮ Exact and heuristic algorithms for the weighted total domination problem ⋮ Integer linear programming models for the weighted total domination problem ⋮ Anti-forcing numbers of perfect matchings of graphs ⋮ On graph fall-coloring: existence and constructions ⋮ The geodetic domination number of comb product graphs ⋮ Complexity of fall coloring for restricted graph classes ⋮ On the complexity of minimum maximal uniquely restricted matching ⋮ Independent domination subdivision in graphs ⋮ On the ratio of the domination number and the independent domination number in graphs ⋮ Independent domination in subcubic bipartite graphs of girth at least six ⋮ Equi independent equitable dominating sets in graphs ⋮ Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph ⋮ Independent double Roman domination in graphs ⋮ INDEPENDENT DOM-SATURATION NUMBER OF A GRAPH ⋮ Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice ⋮ Admissible property of graphs in terms of radius ⋮ On independent domination in planar cubic graphs ⋮ Unnamed Item ⋮ Independent domination in subcubic graphs ⋮ Independent \((k + 1)\)-domination in \(k\)-trees ⋮ Admissible property of graphs in terms of independence number ⋮ Unnamed Item ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds ⋮ Graphs with equal domination and independent domination numbers ⋮ Independent domination of grids ⋮ Independent domination in outerplanar graphs ⋮ The 2-tuple dominating independent number of a random graph ⋮ Independent Feedback Vertex Set for P_5-free Graphs ⋮ Double outer-independent domination number of graphs ⋮ An Efficient Local Search for the Minimum Independent Dominating Set Problem
This page was built for publication: Independent domination in graphs: A survey and recent results
