Pages that link to "Item:Q1827704"
From MaRDI portal
The following pages link to Maximum sizes of graphs with given domination parameters (Q1827704):
Displaying 12 items.
- Equality in a bound that relates the size and the restrained domination number of a graph (Q281803) (← links)
- Maximum size of digraphs with some parameters (Q326498) (← links)
- On size, order, diameter and minimum degree (Q384864) (← links)
- On size, order, diameter and edge-connectivity of graphs (Q682097) (← links)
- Some spin glass ideas applied to the clique problem (Q885046) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Relating the size of a connected graph to its total and restricted domination numbers (Q1827789) (← links)
- Bounds on neighborhood total domination number in graphs (Q2321595) (← links)
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph (Q2446844) (← links)
- Graphs with maximum size and given paired-domination number (Q2449089) (← links)
- An inequality that relates the size of a bipartite graph with its order and restrained domination number (Q5963608) (← links)
- Optimal linear‐Vizing relationships for (total) domination in graphs (Q6201029) (← links)
