Pages that link to "Item:Q659765"

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

Displaying 50 items.

• Trees with 2-reinforcement number three (Q263026) (← links)
• The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
• On the complexity of reinforcement in graphs (Q339476) (← links)
• Algorithmic and structural aspects of the \(P_3\)-Radon number (Q363552) (← links)
• Relating the annihilation number and the 2-domination number of a tree (Q394342) (← links)
• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Trees with maximum \(p\)-reinforcement number (Q401133) (← links)
• An upper bound on the \(P_3\)-Radon number (Q442343) (← links)
• Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
• NP-hardness of multiple bondage in graphs (Q491093) (← links)
• A new generalization of kernels in digraphs (Q516902) (← links)
• Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
• Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
• Independent \((k + 1)\)-domination in \(k\)-trees (Q777366) (← links)
• Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
• On the signed (total) \(k\)-independence number in graphs (Q891311) (← links)
• On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
• Making a dominating set of a graph connected (Q1656909) (← links)
• Client-server and cost effective sets in graphs (Q1713579) (← links)
• Relating the annihilation number and the 2-domination number of block graphs (Q1741511) (← links)
• Bounds on the 2-domination number (Q1744236) (← links)
• Constructing dominating sets in circulant graphs (Q1745909) (← links)
• Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
• Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
• On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
• Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916) (← links)
• On (1,2)-domination in cubic graphs (Q2043407) (← links)
• Bipartite graphs with close domination and \(k\)-domination numbers (Q2053423) (← links)
• Admissible property of graphs in terms of radius (Q2062891) (← links)
• Perfect domination ratios of Archimedean lattices (Q2088708) (← links)
• A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
• Domination, independent domination and \(k\)-independence in trees (Q2119697) (← links)
• Decreasing the maximum degree of a graph (Q2166269) (← links)
• The annihilation number does not bound the 2-domination number from the above (Q2174567) (← links)
• Isolation of cycles (Q2175795) (← links)
• Isolation of \(k\)-cliques (Q2182198) (← links)
• Perfect Italian domination on planar and regular graphs (Q2197486) (← links)
• Domination number, independent domination number and 2-independence number in trees (Q2214304) (← links)
• \([1,k]\)-domination number of lexicographic products of graphs (Q2227955) (← links)
• \( K_{1 , 2}\)-isolation in graphs (Q2231782) (← links)
• On the \(p\)-reinforcement and the complexity (Q2253958) (← links)
• Zero forcing in claw-free cubic graphs (Q2302052) (← links)
• MAX for \(k\)-independence in multigraphs (Q2312650) (← links)
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
• On the \(k\)-domination number of digraphs (Q2331578) (← links)
• On the complexity of multiple bondage in graphs (Q2333796) (← links)
• On general frameworks and threshold functions for multiple domination (Q2352076) (← links)
• A note on the annihilation number and 2-domination number of a tree (Q2359801) (← links)
• Graphs with \(\alpha _1\) and \(\tau _1\) both large (Q2413631) (← links)