scientific article; zbMATH DE number 1507962
From MaRDI portal
Publication:4506068
zbMath0949.05059MaRDI QIDQ4506068
E. J. Cockayne, Odile Favaron, Joël Puech, Christina M. Mynhardt
Publication date: 29 November 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (12)
Strong equality of Roman and weak Roman domination in trees ⋮ \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent ⋮ Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs ⋮ Construction of trees and graphs with equal domination parameters ⋮ A characterization of \((2\gamma ,\gamma _{\text p})\)-trees ⋮ Restrained domination in self-complementary graphs ⋮ A note on an induced subgraph characterization of domination perfect graphs ⋮ A dynamic domination problem in trees ⋮ Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees ⋮ Graphs with equal domination and independent domination numbers ⋮ On weakly connected domination in graphs. II. ⋮ Unique irredundance, domination and independent domination in graphs
Cites Work
- On domination and independent domination numbers of a graph
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Stability, domination and irredundance in a graph
- Vertices contained in every minimum dominating set of a tree
- A note on the characterization of domination perfect graphs
- An induced subgraph characterization of domination perfect graphs
This page was built for publication:
