On the number of independent and \(k\)-dominating sets in graphs with average vertex degree at most \(k\)

DOI10.4213/sm9870eMaRDI QIDQ6492379

Dmitrii Taletskii

Publication date: 25 April 2024

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

zbMATH Keywords

independent setdominating setenumerative combinatorics\(k\)-dominating set

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: On the number of independent and \(k\)-dominating sets in graphs with average vertex degree at most \(k\)