Pages that link to "Item:Q1942046"
From MaRDI portal
The following pages link to Independent domination in graphs: A survey and recent results (Q1942046):
Displaying 50 items.
- The domination number and the least \(Q\)-eigenvalue (Q278336) (← links)
- Graph products of the trivariate total domination polynomial and related polynomials (Q298962) (← links)
- Completion and decomposition of hypergraphs into dominating sets of graphs (Q322230) (← links)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- Independent sets in graphs (Q501998) (← links)
- Bounds on the independence number of a graph in terms of order, size and maximum degree (Q516816) (← links)
- On the ratio of the domination number and the independent domination number in graphs (Q741547) (← links)
- Independent domination in subcubic bipartite graphs of girth at least six (Q741773) (← links)
- Independent \((k + 1)\)-domination in \(k\)-trees (Q777366) (← links)
- A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two (Q821316) (← links)
- On upper transversals in 3-uniform hypergraphs (Q1627202) (← links)
- On upper bounds for the independent transversal domination number (Q1693131) (← links)
- Density of the cototal enumeration degrees (Q1706269) (← links)
- General upper bounds on independent \(k\)-rainbow domination (Q1732101) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Independent domination in bipartite cubic graphs (Q2000581) (← links)
- The \(v\)-number of edge ideals (Q2005190) (← links)
- Interactive natural language question answering over knowledge graphs (Q2005511) (← links)
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916) (← links)
- Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games (Q2019479) (← links)
- Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
- Independent domination subdivision in graphs (Q2045365) (← links)
- Admissible property of graphs in terms of radius (Q2062891) (← links)
- Independent domination in subcubic graphs (Q2075456) (← links)
- Admissible property of graphs in terms of independence number (Q2082373) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Independent domination in outerplanar graphs (Q2104922) (← links)
- An improved upper bound on the independent domination number in cubic graphs of girth at least six (Q2115169) (← links)
- Domination, independent domination and \(k\)-independence in trees (Q2119697) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- New results relating independence and matchings (Q2151222) (← links)
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- Decreasing the maximum degree of a graph (Q2166269) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Isolation of cycles (Q2175795) (← links)
- Domination versus independent domination in graphs of small regularity (Q2182182) (← links)
- Isolation of \(k\)-cliques (Q2182198) (← links)
- Independent domination, colorings and the fractional idomatic number of a graph (Q2185446) (← links)
- On the independent domination polynomial of a graph (Q2217495) (← links)
- Changing and unchanging of the domination number of a graph: path addition numbers (Q2227098) (← links)
- \( K_{1 , 2}\)-isolation in graphs (Q2231782) (← links)
- Integer linear programming models for the weighted total domination problem (Q2279352) (← links)
- On graph fall-coloring: existence and constructions (Q2287754) (← links)
- Independent double Roman domination in graphs (Q2304392) (← links)
- Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice (Q2306596) (← links)
- On independent domination in planar cubic graphs (Q2312063) (← links)
- Independent domination of grids (Q2342624) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
