Bounds on the domination number of Kneser graphs

DOI10.26493/1855-3974.491.B02zbMATH Open1329.05238OpenAlexW1773959918WikidataQ129355387 ScholiaQ129355387MaRDI QIDQ3465656FDOQ3465656

Authors:

Publication date: 22 January 2016

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.491.b02

Recommendations

• Domination in Kneser graphs
• scientific article; zbMATH DE number 1161328
• scientific article; zbMATH DE number 994582
• Remarks on the domination number of graphs
• Domination in Kn\"odel Graphs

zbMATH Keywords

domination numberdominating setKneser graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (9)

• Grundy domination and zero forcing in Kneser graphs
• Domination in Kn\"odel Graphs
• Domination in Kneser graphs
• Bounds on the \(k\)-domination number of a graph
• On hypercube packings, blocking sets and a covering problem
• Title not available (Why is that?)
• Remarks on the domination number of graphs
• Title not available (Why is that?)
• Several Roman domination graph invariants on Kneser graphs

This page was built for publication: Bounds on the domination number of Kneser graphs

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