On edge-rupture degree of graphs

DOI10.1016/J.AMC.2016.07.040MaRDI QIDQ1732840zbMATH OpenOpenAlexFDO

Authors 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

\(r'\)-maximal graphboundaryedge-rupture degreeedge-ruptured graphstrictly edge-ruptured graphvulnerability

Mathematics Subject Classification ID

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

Recommendations

• Edge Rupture Degree of Graphs
• Edge-rupture degree of a graph
• Rupture degree of graphs
• Some results for the rupture degree
• Relationships between rupture degree and other parameters

Cites work

• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• A necessary and sufficient condition for a graph to be edge tenacious
• A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
• Computing the Scattering Number of Graphs
• Edge-integrity: A survey
• Edge-toughness of some regular graphs
• Edge‐tenacious networks
• Graph theory with applications
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 3520451 (Why is no real title available?)
• scientific article; zbMATH DE number 3450248 (Why is no real title available?)
• scientific article; zbMATH DE number 861347 (Why is no real title available?)
• scientific article; zbMATH DE number 927055 (Why is no real title available?)
• scientific article; zbMATH DE number 1409204 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Laplace eigenvalues of graphs---a survey
• Maximal matching energy of tricyclic graphs
• Note on two generalizations of the Randić index
• On Complementary Graphs
• On the algebraic connectivity of graphs as a function of genus
• On the higher-order edge toughness of a graph
• Rupture degree of graphs
• Scattering number in graphs
• Self-complementary graphs
• Tenacity and rupture degree of permutation graphs of complete bipartite graphs
• Tough graphs and Hamiltonian circuits.
• Toughness and edge-toughness
• Traversability and connectivity of the middle graph of a graph

Cited in

(12)

• Edge-neighbor-rupture degree of graphs
• A polynomial algorithm for computing the weak rupture degree of trees
• The weak rupture degree of graphs and the network invulnerability
• Relationships between rupture degree and other parameters
• COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS
• scientific article; zbMATH DE number 6847548 (Why is no real title available?)
• Edge Rupture Degree of Graphs
• Rupture degree and middle graphs
• scientific article; zbMATH DE number 6453262 (Why is no real title available?)
• Edge-rupture degree of a graph
• A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
• Extremal graphs with given order and the rupture degree

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

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