On Complementary Graphs

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

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
CMMSE 18: geometric-arithmetic index and line graph
On the domination number of a graph and its total graph
On \(k\)-rainbow independent domination in graphs
More on the rainbow disconnection in graphs
Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille
A new like quantity based on ``Estrada index
Inequalities of Nordhaus-Gaddum type for doubly connected domination number
Connected domination number of a graph and its complement
Generalized k-tuple colorings of cycles and other graphs
A Nordhaus-Gaddum bound for Roman domination
Nordhaus-Gaddum-type relations of three graph coloring parameters
On ordinary generalized geometric-arithmetic index
Open problems on graph eigenvalues studied with AutoGraphiX
Some inequalities for the first general Zagreb index of graphs and line graphs
On geometric-arithmetic index
Domination in 4-regular graphs with girth 3
Nordhaus-Gaddum-type problems for lines in hypergraphs
The connectivity of a bipartite graph and its bipartite complementary graph
On strong (weak) independent sets and vertex coverings of a graph
On reciprocal complementary Wiener number
Nordhaus-Gaddum type inequalities for some distance-based indices of bipartite molecular graphs
Signless Laplacian eigenvalue problems of Nordhaus-Gaddum type
Graphs which, with their complements, have certain clique covering numbers
On edge-rupture degree of graphs
Using size for bounding expressions of graph invariants
More on limited packings in graphs
Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy
Super dominating sets in graphs
Extremal properties of reciprocal complementary Wiener number of trees
Bounded vertex colorings of graphs
Remarks on odd colorings of graphs
Some progress on the double Roman domination in graphs
Generalizations of some Nordhaus–Gaddum‐type results on spectral radius
Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
Harmonious colourings of graphs
An inertial lower bound for the chromatic number of a graph
Title not available (Why is that?)
The (vertex-)monochromatic index of a graph
Some parameters of graph and its complement
On the product of upper irredundance numbers of a graph and its complement
Chromatic partitions of a graph
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

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)