On the higher-order edge-tenacity of a graph

MaRDI QIDQ4645583zbMATH OpenFDO

Authors Bahareh Bafandeh, Dara Moazzami

Publication date 10 January 2019

zbMATH Keywords

edge-connectivitytenacityvulnerability

Mathematics Subject Classification ID

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

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

Cited in

(9)

• A note on ``Tenacity of a graph with maximum connectivity
• On the first-order edge tenacity of a graph
• On networks with maximum graphical structure and tenacity T
• On the edge-tenacity of graphs
• scientific article; zbMATH DE number 3916308 (Why is no real title available?)
• On the edge‐toughness of a graph. II
• Edge‐tenacious networks
• The weak hyperedge tenacity of the hypercycles
• 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)