On Complementary Graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Some relations between rank, chromatic number and energy of graphs
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
- On reciprocal complementary Wiener number
- Estimating the Szeged index
- Ordered colourings of graphs
- Some parameters of graph and its complement
- On the product of upper irredundance numbers of a graph and its complement
- Inequalities between the domination number and the chromatic number of a graph
- Generalized k-tuple colorings of cycles and other graphs
- Graphs which, with their complements, have certain clique covering numbers
- Extremal regular graphs for the achromatic number
- The product of the independent domination numbers of a graph and its complement
- On Hadwiger's number---A problem of the Nordhaus-Gaddum type
- Chromatic partitions of a graph
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Restrained domination in graphs
- Bidegree of graph and degeneracy number
- The diversity of domination
- On upper bounds for the pseudo-achromatic index
- Inequalities for the chromatic numbers of graphs
- On completely positive graphs and their complements
- On the Laplacian spectral radius of a graph
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- A note on Nordhaus-Gaddum inequalities for domination.
- Extremal graphs in some coloring problems
- Nordhaus-Gaddum problems for power domination
- Some progress on the double Roman domination in graphs
- Nordhaus-Gaddum type result for the matching number of a graph
- Nordhaus-Gaddum bounds for total Roman domination
- Nordhaus-Gaddum-type theorem for total-proper connection number of graphs
- A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
- On conflict-free connection of graphs
- 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 (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph
- The diachromatic number of digraphs
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Signed domination numbers of a graph and its complement
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
- On a Nordhaus-Gaddum type problem for independent domination
- Strength and fractional arboricity of complementary graphs
- Nordhaus-Gaddum inequalities for domination in graphs
- A Nordhaus-Gaddum-type result for the induced path number
- Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement
- CMMSE 18: geometric-arithmetic index and line graph
- Nordhaus-Gaddum type results for graph irregularities
- The (vertex-)monochromatic index of a graph
- Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph
- Some progress on the restrained Roman domination
- Irregular independence and irregular domination
- On a conjecture for power domination
- On the 2-packing differential of a graph
- Some inequalities for the first general Zagreb index of graphs and line graphs
- Nordhaus-Gaddum type inequality for the fractional matching number of a graph
- On the Laplacian spectrum of k-uniform hypergraphs
- Remarks on proper conflict-free colorings of graphs
- Further results on packing related parameters in graphs
- On the chromatic vertex stability number of graphs
- The digrundy number of digraphs
- On (distance) signless Laplacian spectra of graphs
- More on the rainbow disconnection in graphs
- Remarks on odd colorings of graphs
- Nordhaus-Gaddum type inequalities of the second \(A_\alpha\)-eigenvalue of a graph
- Clique coverings and claw-free graphs
- The double Roman domatic number of a digraph
- Monochromatic disconnection of graphs
- Graphs with large Italian domination number
- Distance spectra of graphs: a survey
- Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers
- On general sum-connectivity index
- 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
- The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix
- Comparison and extremal results on three eccentricity-based invariants of graphs
- On the difference of energies of a graph and its complement graph
- Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues
- Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index
- On k-rainbow independent domination in graphs
- On the double Roman domination of graphs
- Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
- Ramsey numbers for degree monotone paths
- On strong metric dimension of graphs and their complements
- The signed total Roman \(k\)-domatic number of a graph
- Some bounds for total communicability of graphs
- On the hyperbolicity constant of circular-arc graphs
- The Wiener index of the \(k\)th power of a graph
- Nordhaus-Gaddum bounds for total domination
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
- On incidence energy of graphs
- On a new cyclicity measure of graphs -- the global cyclicity index
- More eigenvalue problems of Nordhaus-Gaddum type
- The product of the restrained domination numbers of a graph and its complement
- Nordhaus-Gaddum results for the convex domination number of a graph
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- Extension of a list coloring problem
- A map colour theorem for the union of graphs
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)