scientific article; zbMATH DE number 4029614

MaRDI QIDQ3770571zbMATH OpenFDO

Authors Ken Peters, Stephen T. Hedetniemi, Renu C. Laskar

Publication date 1986

zbMATH Keywords

connectivitylower boundsmaximum cutNordhaus-Gaddum type resultsstrength of a graphupper bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 56092
• scientific article; zbMATH DE number 7250383
• Bounds for the strength of graphs
• Computing the Strength of a Graph
• On the strength and domination number of graphs
• On the Strength and Independence Number of Graphs
• On graph irregularity strength
• scientific article; zbMATH DE number 540110
• scientific article; zbMATH DE number 804042
• scientific article; zbMATH DE number 1409188

Cited in

(8)

• Minimum degree conditions for the strength and bandwidth of graphs
• scientific article; zbMATH DE number 3902708 (Why is no real title available?)
• Computing the Strength of a Graph
• scientific article; zbMATH DE number 56092 (Why is no real title available?)
• A result on the strength of graphs by factorizations of complete graphs
• scientific article; zbMATH DE number 7250383 (Why is no real title available?)
• How to make a graph bipartite
• On strong (weak) independent sets and vertex coverings of a graph

This page was built for publication:

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