Pages that link to "Item:Q810066"
From MaRDI portal
The following pages link to Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066):
Displayed 50 items.
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (Q270266) (← links)
- Edge domination in some path and cycle related graphs (Q470539) (← links)
- The domination numbers of cylindrical grid graphs (Q627140) (← links)
- On generalised minimal domination parameters for paths (Q1174129) (← links)
- The product of the independent domination numbers of a graph and its complement (Q1179268) (← links)
- Real and integer domination in graphs (Q1297432) (← links)
- On independent domination number of regular graphs (Q1301709) (← links)
- An upper bound for the independent domination number (Q1306311) (← links)
- The sequence of upper and lower domination, independence and irredundance numbers of a graph (Q1313851) (← links)
- Convexity of minimal dominating functions of trees. II (Q1322265) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Strong weak domination and domination balance in a graph (Q1356427) (← links)
- Domination and irredundance in the queens' graph (Q1356524) (← links)
- The e-mail gossip number and the connected domination number (Q1372291) (← links)
- Irredundant and perfect neighbourhood sets in trees (Q1584343) (← links)
- An algorithm for prescribed multiple domination in arbitrary graphs (Q1608446) (← links)
- Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II (Q1643914) (← links)
- Domination and upper domination of direct product graphs (Q1660257) (← links)
- The domination complexity and related extremal values of large 3D torus (Q1791110) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- On the domination number of cross products of graphs (Q1901047) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Nordhaus-Gaddum inequalities for domination in graphs (Q1923485) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Admissible property of graphs in terms of independence number (Q2082373) (← links)
- Isolation of \(k\)-cliques. II (Q2138948) (← links)
- Closed neighborhood ideals of finite simple graphs (Q2153126) (← 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)
- Isolation of \(k\)-cliques (Q2182198) (← links)
- Domination in direct products of complete graphs (Q2197460) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687) (← links)
- Bounds on the size of the minimum dominating sets of some cylindrical grid graphs (Q2248727) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
- Unions of digraphs which become kernel perfect (Q2420420) (← links)
- Extensions of the Art Gallery Theorem (Q2694454) (← links)
- Minimal dominating set problem studied by simulated annealing and cavity method: analytics and population dynamics (Q3302870) (← links)
- CONVEXITY OF MINIMAL DOMINATING FUNCTIONS OF TREES: A SURVEY (Q4288047) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- (Q4706933) (← links)
- Data Exploration by Representative Region Selection: Axioms and Convergence (Q4958552) (← links)
- Dominating sets in finite generalized quadrangles (Q4993945) (← links)
- Linear programming formulation for some generalized domination parameters (Q5013502) (← links)
- Minimum r-neighborhood covering set of permutation graphs (Q5025160) (← links)
- ON WEAK DOMINATION NUMBER OF SOME GRAPHS (Q5076234) (← links)
- SOME RESULTS ON WEAK DOMINATION IN GRAPHS (Q5076241) (← links)
- Domination number of an interval catch digraph family and its use for testing uniformity (Q5222209) (← links)