The fully weighted toughness of a graph

DOI10.1016/J.DAM.2023.10.008MaRDI QIDQ6180647zbMATH OpenOpenAlexFDO

Authors Wayne Goddard, Julia VanLandingham

Publication date 2 January 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2023.10.008

zbMATH Keywords

weighttoughnessgraph vulnerability

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Communication complexity, information complexity (68Q11)

Recommendations

• On the toughness of graphs
• Toughness and edge-toughness
• A large class of maximally tough graphs
• On the Toughness of a Graph
• scientific article; zbMATH DE number 1437251

Cites work

• scientific article; zbMATH DE number 718663 (Why is no real title available?)
• scientific article; zbMATH DE number 734468 (Why is no real title available?)
• scientific article; zbMATH DE number 3394182 (Why is no real title available?)
• Hamiltonian results inK1,3-free graphs
• On the Toughness of a Graph
• The complexity of recognizing minimally tough graphs
• The weighted integrity problem is polynomial for interval graphs
• Tough graphs and Hamiltonian circuits.
• Toughness in graphs -- a survey

This page was built for publication: The fully weighted toughness of a graph

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