Pages that link to "Item:Q3208702"
From MaRDI portal
The following pages link to Graph-theoretic parameters concerning domination, independence, and irredundance (Q3208702):
Displayed 50 items.
- Irredundance perfect graphs (Q1896349) (← links)
- The Erdös-Sós conjecture for graphs of girth 5 (Q1916132) (← links)
- Well irredundant graphs (Q1917235) (← links)
- On distance spectral radius of graphs (Q1947109) (← links)
- New bounds for the broadcast domination number of a graph (Q1955610) (← links)
- Shortest paths in distance-regular graphs (Q1971798) (← links)
- Star partitions on graphs (Q2010910) (← links)
- Zero forcing versus domination in cubic graphs (Q2025087) (← links)
- Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435) (← links)
- Protection of lexicographic product graphs (Q2062678) (← links)
- On well-dominated direct, Cartesian and strong product graphs (Q2092407) (← links)
- Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \) (Q2107743) (← links)
- Domination in fuzzy incidence graphs based on valid edges (Q2143790) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Total Roman \(\{2\}\)-dominating functions in graphs (Q2151223) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph (Q2217464) (← links)
- Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution (Q2226407) (← links)
- Restrained domination in self-complementary graphs (Q2227117) (← links)
- Graphs with equal eternal vertex cover and eternal domination numbers (Q2275369) (← links)
- On the spectrum and number of convex sets in graphs (Q2339431) (← links)
- Perfectly relating the domination, total domination, and paired domination numbers of a graph (Q2342631) (← links)
- Domination, eternal domination, and clique covering (Q2344016) (← links)
- On the weak Roman domination number of lexicographic product graphs (Q2420431) (← links)
- When an optimal dominating set with given constraints exists (Q2420615) (← links)
- Construction of trees and graphs with equal domination parameters (Q2433721) (← links)
- On matching and semitotal domination in graphs (Q2440939) (← links)
- \([1,2]\)-sets in graphs (Q2446878) (← links)
- Graphs with maximum size and given paired-domination number (Q2449089) (← links)
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors (Q2462341) (← links)
- Matching edges and faces in polygonal partitions (Q2462737) (← links)
- On graphs with equal domination and 2-domination numbers (Q2483412) (← links)
- On matching and total domination in graphs (Q2483421) (← links)
- A note on acyclic domination number in graphs of diameter two (Q2492203) (← links)
- On automorphism groups of circulant digraphs of square-free order (Q2568476) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
- Dominating sets inducing large components (Q2629281) (← links)
- On well-dominated graphs (Q2657074) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- Irredundance (Q3384112) (← links)
- Models of Domination in Graphs (Q3384605) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Private domination number of a graph (Q3545836) (← links)
- The ratio of the distance irredundance and domination numbers of a graph (Q4277983) (← links)
- MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS (Q4288050) (← links)
- (Q4506068) (← links)
- Inequalities involving independence domination, f-domination, connected and total f-domination numbers (Q4814435) (← links)