Neighbor toughness of graphs

MaRDI QIDQ5279205zbMATH OpenFDO

Authors Ömür Kıvanç Kürkçü, Hüseyin Aksan

Publication date 19 July 2017

Full work available at URL http://www.imvibl.org/buletin/bulletin_imvi_6_2_2016/bulletin_imvi_6_2_2015_135_141.pdf

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Recommendations

• Neighbor rupture degree and the relations between other parameters.
• Vertex-neighbor-toughness of the Cartesian products of paths and cycles.
• Graph operations and neighbor rupture degree
• Vulnerability of nearest neighbor graphs
• Neighbor Isolated Tenacity of Graphs

Cited in

(7)

• Graph toughness from Laplacian eigenvalues
• Solitude number at graphs
• Neighbor Isolated Tenacity of Graphs
• Vertex-neighbor-toughness of the Cartesian products of paths and cycles.
• scientific article; zbMATH DE number 1933267 (Why is no real title available?)
• Relationships between vertex attack tolerance and other vulnerability parameters
• A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs

This page was built for publication: Neighbor toughness of graphs

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