On the Number ofk-Dominating Independent Sets

DOI10.1002/jgt.22042zbMath1359.05095arXiv1504.03224OpenAlexW3122488962MaRDI QIDQ2978192

Zoltán Lóránt Nagy

Publication date: 21 April 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.03224

zbMATH Keywords

MDS codesdominationmaximal independent sets\((k,n)\)-arcs\(k\)-DIS\(k\)-dominatingfinite geometry hyperoval

Mathematics Subject Classification ID

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

Related Items (5)

Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets ⋮ Independent double Roman domination in graphs ⋮ Fibonacci numbers in graphs with strong (1, 1, 2)-kernels ⋮ Independent \((k + 1)\)-domination in \(k\)-trees ⋮ The 2-tuple dominating independent number of a random graph

Cites Work

• Unnamed Item
• Unnamed Item
• On the code generated by the incidence matrix of points and hyperplanes in \(\text{PG}(n,q)\) and its dual
• 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
• Maximal arcs in Desarguesian planes of odd order do not exist
• On \((q+t,t)\)-arcs of type \((0,2,t)\)
• Hyperplane sections of Grassmannians and the number of MDS linear codes
• The number of directions determined by a function \(f\) on a finite field
• 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
• Cliques in random graphs
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• An upper bound on the number of cliques in a graph
• Some maximal arcs in finite projective planes
• On cliques in graphs

This page was built for publication: On the Number ofk-Dominating Independent Sets