Pages that link to "Item:Q1941378"
From MaRDI portal
The following pages link to A survey of Nordhaus-Gaddum type relations (Q1941378):
Displaying 50 items.
- Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates (Q293628) (← links)
- Total rainbow connection number and complementary graph (Q310863) (← links)
- A new bound of radius with irregularity index (Q371455) (← links)
- Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues (Q405284) (← links)
- Extrema of graph eigenvalues (Q492762) (← links)
- Some results on the reciprocal sum-degree distance of graphs (Q498415) (← links)
- Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs (Q505439) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- An inertial lower bound for the chromatic number of a graph (Q521386) (← links)
- The Nordhaus-Gaddum-type inequality for the Wiener polarity index (Q668559) (← links)
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- The vertex-rainbow index of a graph (Q726646) (← links)
- Beyond graph energy: norms of graphs and matrices (Q739093) (← links)
- Nordhaus-Gaddum-type relations of three graph coloring parameters (Q741774) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy (Q783162) (← links)
- Nordhaus-Gaddum-type problems for lines in hypergraphs (Q897617) (← links)
- Connected complementary graphs relative to \(K_{a,b}\) and some Nordhaus-Gaddum type results (Q1355403) (← links)
- Nordhaus-Gaddum problems for power domination (Q1627850) (← links)
- Some progress on the double Roman domination in graphs (Q1630922) (← links)
- Nordhaus-Gaddum type result for the matching number of a graph (Q1680497) (← links)
- Strong matching preclusion number of graphs (Q1694672) (← links)
- Matching preclusion number of graphs (Q1711840) (← links)
- A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph (Q1715848) (← links)
- On conflict-free connection of graphs (Q1727736) (← links)
- On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers (Q1732763) (← links)
- On the \(k\)-limited packing numbers in graphs (Q1751194) (← links)
- On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs (Q1752459) (← links)
- Proximity, remoteness and girth in graphs (Q1786868) (← links)
- Strong geodetic number of graphs and connectivity (Q1988559) (← links)
- Nordhaus-Gaddum type results for graph irregularities (Q2008199) (← links)
- Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph (Q2013183) (← links)
- Strong subgraph connectivity of digraphs (Q2045390) (← links)
- Degree tolerant coloring of graph (Q2061289) (← links)
- Nordhaus-Gaddum type inequality for the fractional matching number of a graph (Q2078840) (← links)
- On the Laplacian spectrum of \(k\)-uniform hypergraphs (Q2085415) (← links)
- Further results on 2-distance coloring of graphs (Q2099385) (← links)
- Further results on packing related parameters in graphs (Q2118231) (← links)
- On relations between Sombor and other degree-based indices (Q2143785) (← links)
- On (distance) signless Laplacian spectra of graphs (Q2143825) (← links)
- More on the rainbow disconnection in graphs (Q2158198) (← links)
- Nordhaus-Gaddum type inequalities of the second \(A_\alpha\)-eigenvalue of a graph (Q2185839) (← links)
- Clique coverings and claw-free graphs (Q2189831) (← links)
- Monochromatic disconnection of graphs (Q2208356) (← links)
- Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778) (← links)
- Distance spectra of graphs: a survey (Q2250935) (← links)
- On the distance signless Laplacian spectrum of graphs (Q2272646) (← links)
- Signless Laplacian eigenvalue problems of Nordhaus-Gaddum type (Q2273883) (← links)
- Quasi-total Roman domination in graphs (Q2275312) (← links)
- Toward a Nordhaus-Gaddum inequality for the number of dominating sets (Q2278638) (← links)
