scientific article; zbMATH DE number 7771735
From MaRDI portal
Publication:6072050
arXiv1810.08657MaRDI QIDQ6072050
Daniel McGinnis, Nathan B. Shank
Publication date: 29 November 2023
Full work available at URL: https://arxiv.org/abs/1810.08657
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extremal problem for total domination stable graphs upon edge removal
- An extremal problem for edge domination insensitive graphs
- Generalized domination and efficient domination in graphs
- Maximum sizes of graphs with given domination parameters
- Maximum graphs with a unique minimum dominating set
- Maximum sizes of graphs with given restrained domination numbers
- Graphs with maximum size and given paired-domination number
- The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\)
- Perfect codes in graphs
This page was built for publication:
