The fully weighted toughness of a graph

DOI10.1016/J.DAM.2023.10.008zbMATH Open1530.05073OpenAlexW4388029883MaRDI QIDQ6180647FDOQ6180647

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

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

zbMATH Keywords

weighttoughnessgraph vulnerability

Mathematics Subject Classification ID

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

Cites Work

• Hamiltonian results inK1,3-free graphs
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• The weighted integrity problem is polynomial for interval graphs
• Title not available (Why is that?)
• On the Toughness of a Graph
• The complexity of recognizing minimally tough graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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)