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

DOI10.4213/SM9870EMaRDI QIDQ6492379zbMATH OpenFDO

Authors Dmitrii Taletskii

Publication date 25 April 2024

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

Full work available at URL https://doi.org/10.4213/SM9870E

zbMATH Keywords

\(k\)-dominating setdominating setenumerative combinatoricsindependent set

Mathematics Subject Classification ID

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

Recommendations

• Independence and k-domination in graphs
• The average order of dominating sets of a graph
• A tight upper bound on the average order of dominating sets of a graph
• On the number of k-dominating independent sets
• Domination versus independent domination in regular graphs

Cites work

• A note on the number of dominating sets of a graph
• An entropy approach to the hard-core model on bipartite graphs
• scientific article; zbMATH DE number 3745213 (Why is no real title available?)
• Independent sets in graphs
• Independent sets in quasi-regular graphs
• Independent sets in regular graphs and sum-free subsets of finite groups
• Maximizing the number of independent subsets over trees with bounded degree
• The number of independent sets in a regular graph
• Trees with extremal numbers of \(k\)-dominating sets
• Trees with extremal numbers of dominating sets

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

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