A survey of Nordhaus-Gaddum type relations
From MaRDI portal
Publication:1941378
DOI10.1016/j.dam.2011.12.018zbMath1259.05083OpenAlexW2078743813MaRDI QIDQ1941378
Pierre Hansen, Mustapha Aouchiche
Publication date: 12 March 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.018
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)
Related Items (97)
Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ Nordhaus-Gaddum problems for power domination ⋮ Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates ⋮ Some progress on the double Roman domination in graphs ⋮ Total rainbow connection number and complementary graph ⋮ On relations between Sombor and other degree-based indices ⋮ On (distance) signless Laplacian spectra of graphs ⋮ On the domination number of a graph and its block graph ⋮ More on the rainbow disconnection in graphs ⋮ On three outer-independent domination related parameters in graphs ⋮ Total domination number of middle graphs ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ A new bound of radius with irregularity index ⋮ The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph ⋮ Nordhaus-Gaddum bounds for upper total domination ⋮ Nordhaus-Gaddum type result for the matching number of a graph ⋮ Coefficient of domination in graph ⋮ Nordhaus-Gaddum type inequalities of the second \(A_\alpha\)-eigenvalue of a graph ⋮ Extremal decompositions for Nordhaus-Gaddum theorems ⋮ Some bounds for total communicability of graphs ⋮ On the hyperbolicity constant of circular-arc graphs ⋮ Clique coverings and claw-free graphs ⋮ Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues ⋮ Generalizations of some Nordhaus–Gaddum‐type results on spectral radius ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph ⋮ Nordhaus-Gaddum-type problems for lines in hypergraphs ⋮ Nordhaus–Gaddum problem in terms of G-free coloring ⋮ Strong matching preclusion number of graphs ⋮ Domination in edge cycle graphs ⋮ Graph Limits and Spectral Extremal Problems for Graphs ⋮ Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues ⋮ Nordhaus-Gaddum-type results on the connected edge domination number ⋮ Improving upper bounds for the distinguishing index ⋮ Monochromatic disconnection of graphs ⋮ Matching preclusion number of graphs ⋮ Nordhaus-Gaddum bounds for locating domination ⋮ On incidence energy of graphs ⋮ A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph ⋮ More eigenvalue problems of Nordhaus-Gaddum type ⋮ On conflict-free connection of graphs ⋮ On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers ⋮ Stabilizing the distinguishing number of a graph ⋮ Hardness and efficiency on \(t\)-admissibility for graph operations ⋮ The Nordhaus-Gaddum-type inequality for the Wiener polarity index ⋮ Extrema of graph eigenvalues ⋮ Unnamed Item ⋮ Some results on the reciprocal sum-degree distance of graphs ⋮ Unnamed Item ⋮ Certified domination ⋮ Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs ⋮ Distance Laplacian eigenvalues and chromatic number in graphs ⋮ Strong geodetic number of graphs and connectivity ⋮ More bounds for the Grundy number of graphs ⋮ Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs ⋮ On the \(k\)-limited packing numbers in graphs ⋮ On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs ⋮ An inertial lower bound for the chromatic number of a graph ⋮ Distance spectra of graphs: a survey ⋮ Nordhaus-Gaddum type results for graph irregularities ⋮ On dominated coloring of graphs and some Nordhaus–Gaddum-type relations ⋮ Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph ⋮ On the distance signless Laplacian spectrum of graphs ⋮ Signless Laplacian eigenvalue problems of Nordhaus-Gaddum type ⋮ Quasi-total Roman domination in graphs ⋮ Toward a Nordhaus-Gaddum inequality for the number of dominating sets ⋮ Proximity, remoteness and girth in graphs ⋮ The number of independent sets in a connected graph and its complement ⋮ The vertex-rainbow index of a graph ⋮ Products of graphs and Nordhaus-Gaddum type inequalities for eigenvalues ⋮ The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix ⋮ Further properties on the degree distance of graphs ⋮ Nordhaus-Gaddum Type results for the Harary index of graphs ⋮ Bounds for the spectral radius and energy of extended adjacency matrix of graphs ⋮ Beyond graph energy: norms of graphs and matrices ⋮ Strong subgraph connectivity of digraphs ⋮ Nordhaus-Gaddum-type relations of three graph coloring parameters ⋮ Open problems on graph eigenvalues studied with AutoGraphiX ⋮ Connected Domination ⋮ Distance Domination in Graphs ⋮ Nordhaus-Gaddum type inequalities for the distinguishing index ⋮ Degree tolerant coloring of graph ⋮ Eigenvalues of thek-th power of a graph ⋮ Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues ⋮ Nordhaus-Gaddum type inequality for the fractional matching number of a graph ⋮ Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy ⋮ On the Laplacian spectrum of \(k\)-uniform hypergraphs ⋮ Packing parameters in graphs: new bounds and a solution to an open problem ⋮ Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index ⋮ On \(k\)-rainbow independent domination in graphs ⋮ How to Burn a Graph ⋮ On the domination number of a graph and its total graph ⋮ Nordhaus-Gaddum-type result on the second largest signless Laplacian eigenvalue of a graph ⋮ Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs ⋮ Further results on 2-distance coloring of graphs ⋮ On the domination number of a graph and its shadow graph ⋮ Further results on packing related parameters in graphs
Uses Software
This page was built for publication: A survey of Nordhaus-Gaddum type relations
