scientific article; zbMATH DE number 6694457

zbMATH Open1389.05128MaRDI QIDQ2969111FDOQ2969111

Ludovit Niepel, Anton Černý

Publication date: 14 March 2017

Title of this publication is not available (Why is that?)

zbMATH Keywords

dominating setindependent setpath graph

Mathematics Subject Classification ID

Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38)

Cited In (4)

• Complexes of directed trees and independence complexes
• Independence number of graphs and line graphs of trees by means of omega invariant
• Title not available (Why is that?)
• Edge domination and 2-independence in trees

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Independence andk-domination in graphs 👍 👎
• Independent Domination on Tree Convex Bipartite Graphs 👍 👎
• Independent \((k + 1)\)-domination in \(k\)-trees 👍 👎
• Domination, independent domination and \(k\)-independence in trees 👍 👎
• Independent transversal total domination versus total domination in trees 👍 👎
• Independence number and \(k\)-trees of graphs 👍 👎
• Edge domination and 2-independence in trees 👍 👎

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 Q2969111)