Generalized independence and domination in graphs

DOI10.1016/S0012-365X(98)00092-2zbMATH Open0958.05102OpenAlexW2072286302MaRDI QIDQ1584435FDOQ1584435

Mieczysław Borowiecki, Danuta Michalak

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00092-2

Recommendations

• scientific article; zbMATH DE number 1161346
• On generalised minimal domination parameters for paths
• Hereditary domination and independence parameters
• Generalized domination, independence and irredudance in graphs
• Independent partial domination

zbMATH Keywords

dominationvertex partitionindependent subsets\({\mathcal P}\)-domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two Bounds for the Domination Number of a Graph
• Title not available (Why is that?)
• Bounds on a generalized domination parameter
• Title not available (Why is that?)

Cited In (5)

• Independence-domination duality
• Independence and graph homomorphisms graph homomorphisms
• Atom probe tomography characterization of solute segregation to dislocations and interfaces
• Independent sets in graphs
• Data reductions and combinatorial bounds for improved approximation algorithms

This page was built for publication: Generalized independence and domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584435)