Pages that link to "Item:Q659765"

The following pages link to \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765):

Displaying 40 items.

• Graphs with \(\alpha _1\) and \(\tau _1\) both large (Q2413631) (← links)
• Covers and partial transversals of Latin squares (Q2414936) (← links)
• On upper bounds for multiple domination numbers of graphs (Q2444571) (← links)
• On \(k\)-domination and \(j\)-independence in graphs (Q2446328) (← links)
• Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334) (← links)
• Partitions of graphs into small and large sets (Q2446835) (← links)
• Heuristics for \(k\)-domination models of facility location problems in street networks (Q2668796) (← links)
• \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems (Q2686849) (← links)
• Thresholds for the monochromatic clique transversal game (Q2695001) (← links)
• The p-domination number of complete multipartite graphs (Q2931929) (← links)
• Multiple Domination (Q3384609) (← links)
• (Open) packing number of some graph products (Q3386621) (← links)
• (K, j)-domination and (K, j)-reliability (Q4369765) (← links)
• Independent Roman domination and 2-independence in trees (Q4577859) (← links)
• Mixed Roman domination and 2-independence in trees (Q4583517) (← links)
• On the packing numbers in graphs (Q4614038) (← links)
• ANOTHER LOOK AT k-DOMINATION IN GRAPHS (Q4973417) (← links)
• On the signed 2-independence number of graphs (Q5006598) (← links)
• Edge domination and 2-independence in trees (Q5013448) (← links)
• A Taxonomy of Perfect Domination (Q5069690) (← links)
• Partial domination - the isolation number of a graph (Q5162046) (← links)
• The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products (Q5198005) (← links)
• Distinguished Minimal Topological Lassos (Q5265017) (← links)
• Roman domination and 2-independence in trees (Q5347257) (← links)
• On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
• Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← links)
• Domatically full Cartesian product graphs (Q5876780) (← links)
• 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
• \( P_5\)-isolation in graphs (Q6048444) (← links)
• (Q6089655) (← links)
• \(K_{1, 2}\)-isolation number of claw-free cubic graphs (Q6131040) (← links)
• Bounds on the Twin-Width of Product Graphs (Q6131799) (← links)
• (Q6150889) (← links)
• On the 2-independence subdivision number of graphs (Q6158957) (← links)
• Nordhaus-Gaddum-type results on the connected edge domination number (Q6202040) (← links)
• 2-independent domination in trees (Q6566791) (← links)
• Complexity results on \(k\)-independence in some graph products (Q6594024) (← links)
• \(k\)-isolation in graphs (Q6611012) (← links)
• Algorithmic study on 2-transitivity of graphs (Q6611052) (← links)
• A note on the \(P_3\)-isolation number of a graph (Q6658909) (← links)