The weak hyperedge tenacity of the hypercycles

MaRDI QIDQ5210490zbMATH OpenFDO

Authors G. H. Shirdel, B. Vaez-Zadeh

Publication date 20 January 2020

Full work available at URL http://www.pvamu.edu/aam/wp-content/uploads/sites/182/2019/12/43-R1234_AAM_Shirdel_GS_102518_Published_121319.pdf

zbMATH Keywords

hypergraphshypercyclestenacityweak hyperedge deletion

Mathematics Subject Classification ID

Connectivity (05C40) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 2197993
• On the higher-order edge-tenacity of a graph
• On the edge-tenacity of graphs
• Edge‐tenacious networks
• On networks with maximum graphical structure and tenacity \(T\)

Cites work

• scientific article; zbMATH DE number 1339493 (Why is no real title available?)
• scientific article; zbMATH DE number 718660 (Why is no real title available?)
• scientific article; zbMATH DE number 1501969 (Why is no real title available?)
• scientific article; zbMATH DE number 2114075 (Why is no real title available?)
• scientific article; zbMATH DE number 861347 (Why is no real title available?)
• scientific article; zbMATH DE number 5050554 (Why is no real title available?)
• Computing the tenacity of some graphs
• Connection and separation in hypergraphs
• Connectivity in hypergraphs
• Edge-augmentation of hypergraphs
• Extreme tenacity of graphs with given order and size
• Graph theory with applications
• On the edge-tenacity of graphs
• Some results related to the tenacity and existence of \(k\)-trees
• Tenacity of a graph with maximum connectivity
• Vertex vulnerability parameters of Kronecker products of complete graphs

Cited in

(1)

• Finding a minimal spanning hypertree of a weighted hypergraph

This page was built for publication: The weak hyperedge tenacity of the hypercycles

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