On edge-rupture degree of graphs

DOI10.1016/J.AMC.2016.07.040zbMath1410.05185OpenAlexW2477906301MaRDI QIDQ1732840

Xianqiang Yang

Publication date: 25 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2016.07.040

zbMATH Keywords

vulnerabilityboundary\(r'\)-maximal graphedge-rupture degreeedge-ruptured graphstrictly edge-ruptured graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10)

Related Items (2)

Edge Rupture Degree of Graphs ⋮ A polynomial algorithm for computing the weak rupture degree of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tenacity and rupture degree of permutation graphs of complete bipartite graphs
• Laplace eigenvalues of graphs---a survey
• On the higher-order edge toughness of a graph
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• On the algebraic connectivity of graphs as a function of genus
• Traversability and connectivity of the middle graph of a graph
• Edge-integrity: A survey
• Toughness and edge-toughness
• Note on two generalizations of the Randić index
• A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
• Tough graphs and Hamiltonian circuits.
• Scattering number in graphs
• On Complementary Graphs
• Edge‐tenacious networks
• Computing the Scattering Number of Graphs
• The Maximal Matching Energy of Tricyclic Graphs
• Rupture degree of graphs
• Self-complementary graphs
• A necessary and sufficient condition for a graph to be edge tenacious

This page was built for publication: On edge-rupture degree of graphs