Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets

DOI10.1016/J.ENDM.2017.07.053zbMath1378.05156OpenAlexW2744540962MaRDI QIDQ1690033

Zoltán Lóránt Nagy

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.053

zbMATH Keywords

finite geometryMDS codesdominationmaximal independent sets\((2-d)\)-kernels\(k\)-DIS

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Fibonacci numbers in graphs with strong (1, 1, 2)-kernels

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of maximal independent sets in a connected graph
• On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
• Hyperplane sections of Grassmannians and the number of MDS linear codes
• On the Number ofk-Dominating Independent Sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Number of Maximal Independent Sets in a Tree
• A Note on Independent Sets in Trees
• The number of maximal independent sets in connected graphs
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Some maximal arcs in finite projective planes
• On cliques in graphs

This page was built for publication: Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets