Pages that link to "Item:Q1598803"
From MaRDI portal
The following pages link to Upper bounds for the \(k\)-subdomination number of graphs (Q1598803):
Displaying 10 items.
- On the upper tail of counts of strictly balanced subgraphs (Q426748) (← links)
- Bounds for the number of mappings of graphs and for the number of subgraphs (Q912119) (← links)
- Handle bases and bounds on the number of subgraphs (Q1087883) (← links)
- Minus \(k\)-subdomination in graphs. II (Q1363694) (← links)
- Lower bounds on the minus domination and \(k\)-subdomination numbers. (Q1401262) (← links)
- \(k\)-subdomination in graphs (Q1613364) (← links)
- The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination (Q2282474) (← links)
- On a Problem Concerning k-Subdomination Numbers of Graphs (Q3366594) (← links)
- Signed and Minus Dominating Functions in Graphs (Q3384612) (← links)
- Dominating functions with integer values in graphs—a survey (Q5456310) (← links)