On the higher-order edge-tenacity of a graph

zbMATH Open1407.05215MaRDI QIDQ4645583FDOQ4645583

Authors: Bahareh Bafandeh, Dara Moazzami 

Publication date: 10 January 2019

Recommendations

• On the edge-tenacity of graphs
• scientific article; zbMATH DE number 2197993
• scientific article; zbMATH DE number 861347
• scientific article; zbMATH DE number 3916308
• Computing the tenacity of some graphs

zbMATH Keywords

vulnerabilityedge-connectivitytenacity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40)

Cited In (8)

• On the first-order edge tenacity of a graph
• On the edge‐toughness of a graph. II
• On the edge-tenacity of graphs
• The weak hyperedge tenacity of the hypercycles
• A note on ``Tenacity of a graph with maximum connectivity
• On networks with maximum graphical structure and tenacity \(T\)
• Title not available (Why is that?)
• A necessary and sufficient condition for a graph to be edge tenacious

This page was built for publication: On the higher-order edge-tenacity of a graph

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