\(k\)-domination and \(k\)-independence in graphs: A survey (Q659765): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GRAFFITI / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-011-1040-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017926358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination and independent domination numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal numbers of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-tuple domination of de Bruijn and Kautz digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-domination subdivision number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2936700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5709011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-independence in graphs with emphasis on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal k-independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of trees with equal paired and double domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the p-domination number of cactus graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some bounds on the \(p\)-domination number in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3421952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOUNDS ON THE DOMINATION NUMBER OF A GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4711895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the k-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on <i>k</i>‐independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Domination and Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating a Family of Graphs with Small Connected Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Problems for Roman Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the double domination number in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5443774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3635572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3581670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ratios of some domination parameters in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3105546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-independence stable graphs upon edge removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact double domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of trees with equal 2-domination number and domination number plus two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for \(f\)-domination number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the theory of domination, independence and irredundance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for thek-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3507265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect stables in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the \(k\)-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on total domination in direct products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hadwiger's Number and the Stability Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Nordhaus-Gaddum inequalities for domination. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjectures of Graffiti / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Fink and Jacobson concerning k-domination and k- dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4711489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative definition of the \(k\)-irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2895350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Onk-domination and minimum degree in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-dependent domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination and annihilation in graphs with claw-free blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the residue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs having domination number half their order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the corona of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5449168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalised upper bound for the \(k\)-tuple domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The insulation sequence of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose vertex independence number is unaffected by single edge addition or deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the connected \(k\)-domination number in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method in the theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and<i>k</i>-domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-domination and \(j\)-independence in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs with equal 2-domination and domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of block graphs with equal 2-domination number and domination number plus one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with equal domination and 2-domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3635575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2918564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Double Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3534267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum inequalities for domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-forming sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with two disjoint minimum independent dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3626183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with double domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-Independence and thek-residue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained double domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k-domatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: ROMAN k-DOMINATION IN GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5443162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the (2,2)-domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the p-domination number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (2,2)-domination number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2895378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of (γ<sub>t</sub>,γ<sub>2</sub>)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-Tuple domination number in complete grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between packing and covering numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4108373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination-balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2995153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of graphs with equal domination and covering number / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the \(k\)-domination number and the \(k\)-tuple domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defendens Imperium Romanum: A Classical Problem in Military Strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3399449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The roman domatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new domination conception / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3366499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3507263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3561427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the k-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the k-tuple domatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Onk-tuple domination of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domination number of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture on \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $k$-domatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $f$-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities involving independence domination, f-domination, connected and total f-domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-tuple domination number revisited / rank
 
Normal rank

Revision as of 20:24, 4 July 2024

scientific article
Language Label Description Also known as
English
\(k\)-domination and \(k\)-independence in graphs: A survey
scientific article

    Statements

    \(k\)-domination and \(k\)-independence in graphs: A survey (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 January 2012
    0 references
    \(k\)-domination
    0 references
    \(k\)-independence
    0 references
    \(k\)-tuple domination
    0 references
    \(k\)-irredundance
    0 references
    \(k\)-star-forming
    0 references
    \(l\)-total \(k\)-domination
    0 references
    connected \(k\)-domination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers