scientific article; zbMATH DE number 795022
From MaRDI portal
Publication:4847233
zbMATH Open0830.05052MaRDI QIDQ4847233FDOQ4847233
Authors: Jerzy Topp 
Publication date: 10 December 1995
Title of this publication is not available (Why is that?)
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cited In (21)
- Split Domination, Independence, and Irredundance in Graphs
- Title not available (Why is that?)
- Upper domination and upper irredundance perfect graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Title not available (Why is that?)
- On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
- On kernels by monochromatic paths in the corona of digraphs
- On the existence and the number of independent (1,2)-dominating sets in the \(G\)-join of graphs
- Unique irredundance, domination and independent domination in graphs
- Locally well-dominated and locally independent well-dominated graphs
- Edge Cut Domination, Irredundance, and Independence in Graphs
- On \(\alpha\)-excellent graphs
- Domination and irredundance in graphs with restricted blocks
- Irredundance
- Cycle domination, independence, and irredundance in graphs
- The rati of the irredundance and domination number of a graph
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- On the sum of two parameters concerning independence and irredundance in a graph
- Parameters of independence and domination by monochromatic paths in graphs
- Interpolation theorems for domination numbers of a graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4847233)
