On Complementary Graphs

DOI10.2307/2306658zbMath0070.18503OpenAlexW2319043422MaRDI QIDQ3231818

Publication date: 1956

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2306658

zbMATH Keywords

topology

Related Items (only showing first 100 items - show all)

Bidegree of graph and degeneracy number ⋮ 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 ⋮ On incidence energy of a graph ⋮ Some progress on the double Roman domination in graphs ⋮ Split graphs and Nordhaus-Gaddum graphs ⋮ Some parameters of graph and its complement ⋮ The rainbow vertex-index of complementary graphs ⋮ Total rainbow connection number and complementary graph ⋮ On the signed total Roman domination and domatic numbers of graphs ⋮ On geometric-arithmetic index ⋮ The diversity of domination ⋮ Maximum size of digraphs with some parameters ⋮ On strong (weak) independent sets and vertex coverings of a graph ⋮ On the product of upper irredundance numbers of a graph and its complement ⋮ Nordhaus-Gaddum-type theorem for rainbow connection number of graphs ⋮ Inequalities between the domination number and the chromatic number of a graph ⋮ On upper bounds for the pseudo-achromatic index ⋮ Bounds on the (Laplacian) spectral radius of graphs ⋮ A new like quantity based on ``Estrada index ⋮ Inequalities of Nordhaus-Gaddum type for doubly connected domination number ⋮ The bipartite edge frustration of composite graphs ⋮ Nordhaus-Gaddum type result for the matching number of a graph ⋮ Nordhaus-Gaddum theorem for the distinguishing chromatic number ⋮ On ordinary generalized geometric-arithmetic index ⋮ Super dominating sets in graphs ⋮ Inequalities for the chromatic numbers of graphs ⋮ Domination in 4-regular graphs with girth 3 ⋮ Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues ⋮ Nordhaus-Gaddum for treewidth ⋮ Nordhaus-Gaddum-type problems for lines in hypergraphs ⋮ Improper C-colorings of graphs ⋮ Nordhaus-Gaddum bounds for total Roman domination ⋮ On completely positive graphs and their complements ⋮ Multiple factor Nordhaus-Gaddum type results for domination and total domination ⋮ Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph ⋮ Generalized k-tuple colorings of cycles and other graphs ⋮ Graphs which, with their complements, have certain clique covering numbers ⋮ On the Laplacian spectral radius of a graph ⋮ On the equality of the partial Grundy and upper ochromatic numbers of graphs ⋮ Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts ⋮ New Nordhaus-Gaddum-type results for the Kirchhoff index ⋮ Nordhaus-Gaddum-type theorem for total-proper connection number of graphs ⋮ Using size for bounding expressions of graph invariants ⋮ A note on Nordhaus-Gaddum inequalities for domination. ⋮ A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph ⋮ Extremal properties of reciprocal complementary Wiener number of trees ⋮ Extremal regular graphs for the achromatic number ⋮ On conflict-free connection of graphs ⋮ The signed Roman \(k\)-domatic number of a graph ⋮ Connected domination number of a graph and its complement ⋮ Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph ⋮ The product of the independent domination numbers of a graph and its complement ⋮ The Roman \(\{2 \}\)-domatic number of graphs ⋮ On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers ⋮ On edge-rupture degree of graphs ⋮ On reciprocal molecular topological index ⋮ The Nordhaus-Gaddum-type inequality for the Wiener polarity index ⋮ On rainbow total-coloring of a graph ⋮ Some results on the reciprocal sum-degree distance of graphs ⋮ More bounds for the Grundy number of graphs ⋮ Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs ⋮ Choice number and energy of graphs ⋮ Harmonious colourings of graphs ⋮ On Hadwiger's number---A problem of the Nordhaus-Gaddum type ⋮ Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number ⋮ On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ Bounded vertex colorings of graphs ⋮ An inertial lower bound for the chromatic number of a graph ⋮ A survey of automated conjectures in spectral graph theory ⋮ On the graph complement conjecture for minimum semidefinite rank ⋮ On Harary index ⋮ The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs ⋮ Nordhaus-Gaddum relations for proximity and remoteness in graphs ⋮ The diachromatic number of digraphs ⋮ Proper connection numbers of complementary graphs ⋮ The vertex-rainbow index of a graph ⋮ Nordhaus-Gaddum-type results for resistance distance-based graph invariants ⋮ Graphs with no induced \(C_ 4\) and \(2K_ 2\) ⋮ Beyond graph energy: norms of graphs and matrices ⋮ Nordhaus-Gaddum-type relations of three graph coloring parameters ⋮ Open problems on graph eigenvalues studied with AutoGraphiX ⋮ Some relations between rank, chromatic number and energy of graphs ⋮ Chromatic partitions of a graph ⋮ Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers ⋮ On reciprocal complementary Wiener number ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ Signed domination numbers of a graph and its complement ⋮ Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum ⋮ Estimating the Szeged index ⋮ Nordhaus-Gaddum type inequalities for some distance-based indices of bipartite molecular graphs ⋮ More on limited packings in graphs ⋮ Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy ⋮ On a Nordhaus-Gaddum type problem for independent domination ⋮ Extremal graphs in some coloring problems ⋮ Ordered colourings of graphs ⋮ Restrained domination in graphs ⋮ Graph factorization and theorems of the Nordhaus-Gaddum class ⋮ Relations between parameters of a graph

This page was built for publication: On Complementary Graphs