Pages that link to "Item:Q1174141"
From MaRDI portal
The following pages link to Maximum number of edges in connected graphs with a given domination number (Q1174141):
Displaying 18 items.
- Sizes and transmissions of digraphs with a given clique number (Q281810) (← links)
- Maximum size of digraphs with some parameters (Q326498) (← links)
- Domination number and neighbourhood conditions (Q1296973) (← links)
- A generalization of Vizing's theorem on domination (Q1318834) (← links)
- New results about the bondage number of a graph (Q1363706) (← links)
- Average distance and domination number (Q1377614) (← links)
- Generating hard and diverse test sets for NP-hard graph problems (Q1805463) (← links)
- Maximum sizes of graphs with given domination parameters (Q1827704) (← links)
- Relating the size of a connected graph to its total and restricted domination numbers (Q1827789) (← links)
- Some results on characterizing the edges of connected graphs with a given domination number (Q1893172) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Bounds on neighborhood total domination number in graphs (Q2321595) (← links)
- On the spectral radius of graphs with a given domination number (Q2479498) (← links)
- Traceability of connected domination critical graphs (Q2656675) (← links)
- Upper bounds on the bondage number of a graph (Q5009964) (← links)
- LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER (Q5324146) (← links)
- Optimal linear‐Vizing relationships for (total) domination in graphs (Q6201029) (← links)
- On approximation of multiple intruder locating domination number of a graph (Q6551048) (← links)
