On Complementary Graphs

Cited In (only showing first 100 items - show all)

The number of independent sets in a connected graph and its complement
Broadcasts in graphs
Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
On strong metric dimension of graphs and their complements
Clique coverings and claw-free graphs
The signed total Roman \(k\)-domatic number of a graph
List point arboricity of graphs
Extremal graphs in some coloring problems
Nordhaus-Gaddum-type theorem for diameter of graphs when decomposing into many parts
New Nordhaus-Gaddum-type results for the Kirchhoff index
Nordhaus-Gaddum for treewidth
Some results on the reciprocal sum-degree distance of graphs
Some extremal results on the colorful monochromatic vertex-connectivity of a graph
Study of the bipartite edge frustration of graphs
Nordhaus-Gaddum inequalities for domination in graphs
Improper C-colorings of graphs
Graph colourings and partitions
Estimating the Szeged index
More eigenvalue problems of Nordhaus-Gaddum type
Inequalities for the first-fit chromatic number
Multiple factor Nordhaus-Gaddum type results for domination and total domination
On total restrained domination in graphs
On Harary index
The bipartite edge frustration of composite graphs
On Hadwiger's number---A problem of the Nordhaus-Gaddum type
The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs
Regular number of a graph
Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates
Graph factorization and theorems of the Nordhaus-Gaddum class
Split graphs and Nordhaus-Gaddum graphs
Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues
The diachromatic number of digraphs
Bounds on the (Laplacian) spectral radius of graphs
Nordhaus-Gaddum theorem for the distinguishing chromatic number
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
On reciprocal molecular topological index
On the hyperbolicity constant of circular-arc graphs
The rainbow vertex-index of complementary graphs
On (distance) signless Laplacian spectra of graphs
Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
The number of spanning trees of a graph
Restrained domination in graphs
The digrundy number of digraphs
On zero forcing number of graphs and their complements
Total rainbow connection number and complementary graph
On the signed total Roman domination and domatic numbers of graphs
On the equality of the partial Grundy and upper ochromatic numbers of graphs
A note on Nordhaus-Gaddum inequalities for domination.
Distance spectra of graphs: a survey
On general sum-connectivity index
The Roman \(\{2 \}\)-domatic number of graphs
Maximum size of digraphs with some parameters
On incidence energy of graphs
Graphs with no induced \(C_ 4\) and \(2K_ 2\)
The Laplacian spread of graphs.
On the Laplacian spectral radius of a graph
Restrained and total restrained domination in graphs
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
Nordhaus-Gaddum relations for proximity and remoteness in graphs
The signed Roman \(k\)-domatic number of a graph
Relations between parameters of a graph
Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
On the distance signless Laplacian spectrum of graphs
Nordhaus-Gaddum-type results for resistance distance-based graph invariants
Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement
On completely positive graphs and their complements
Distance domination in graphs
Nordhaus-Gaddum bounds for total domination
Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
On the algorithmic complexity of twelve covering and independence parameters of graphs
Beyond graph energy: norms of graphs and matrices
On rainbow total-coloring of a graph
The fractional strong metric dimension of graphs
Some relations between rank, chromatic number and energy of graphs
Roman domination in graphs
More bounds for the Grundy number of graphs
The Nordhaus-Gaddum-type inequality for the Wiener polarity index
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
A survey of automated conjectures in spectral graph theory
Proper connection numbers of complementary graphs
On incidence energy of a graph
Weak signed Roman \(k\)-domatic number of a graph
Ordered colourings of graphs
The Wiener index of the \(k\)th power of a graph
Choice number and energy of graphs
On sum of powers of the Laplacian eigenvalues of graphs
The tree-covering number of a graph
On the double Roman domination of graphs
Certified domination
Signed domination numbers of a graph and its complement
Inequalities between the domination number and the chromatic number of a graph
Title not available (Why is that?)
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
A map colour theorem for the union of graphs
On the graph complement conjecture for minimum semidefinite rank
Nordhaus-Gaddum-type result on the second largest signless Laplacian eigenvalue of a graph
The diversity of domination
How to Burn a Graph
The vertex-rainbow index of a graph

This page was built for publication: On Complementary Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3231818)