Some nordhaus‐‐ gaddum‐type results

DOI10.1002/JGT.3190160305zbMATH Open0774.05095OpenAlexW2074690936MaRDI QIDQ4013424FDOQ4013424

Authors Wayne Goddard, Michael A. Henning, H. C. Swart 

Publication date 27 September 1992

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190160305

zbMATH Keywords

independencefactorizationdominationcomplete bipartite graphNordhaus-Gaddum-type

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 500499
• scientific article; zbMATH DE number 3896958
• Generalizations of some Nordhaus–Gaddum‐type results on spectral radius
• scientific article; zbMATH DE number 3959454
• A survey of Nordhaus-Gaddum type relations
• scientific article; zbMATH DE number 68910
• scientific article; zbMATH DE number 2068357
• New Nordhaus-Gaddum-type results for the Kirchhoff index
• scientific article; zbMATH DE number 3941567
• Extremal decompositions for Nordhaus-Gaddum theorems

Cited in

(21)

• Nordhaus-Gaddum bounds for upper total domination
• A Nordhaus-Gaddum-type result for the induced path number
• Simultaneous graph parameters: factor domination and factor total domination
• Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
• Multiple factor Nordhaus-Gaddum type results for domination and total domination
• Nordhaus-Gaddum type inequality for the fractional matching number of a graph
• On a Nordhaus-Gaddum type problem for independent domination
• Nordhaus-Gaddum bounds for total domination
• Nordhaus-Gaddum type result for the matching number of a graph
• scientific article; zbMATH DE number 2068357 (Why is no real title available?)
• Factor domination and minimum degree
• Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index
• Connected domination critical graphs with respect to relative complements
• Nordhaus-Gaddum-type theorem for diameter of graphs when decomposing into many parts
• On Hadwiger's number---A problem of the Nordhaus-Gaddum type
• Maximum size of digraphs with some parameters
• scientific article; zbMATH DE number 5015716 (Why is no real title available?)
• scientific article; zbMATH DE number 3896958 (Why is no real title available?)
• Factor domination in graphs
• scientific article; zbMATH DE number 1792633 (Why is no real title available?)
• Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars

This page was built for publication: Some nordhaus‐‐ gaddum‐type results

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