Neighbor Isolated Tenacity of Graphs

DOI10.1051/ITA/2016001MaRDI QIDQ3186667zbMATH OpenOpenAlexFDO

Authors Ersin Aslan

Publication date 12 August 2016

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ita/2016001

zbMATH Keywords

isolated scattering numberrupture degreetenacity

Mathematics Subject Classification ID

Connectivity (05C40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 7404149
• Tenacity of total graphs
• Neighbor toughness of graphs
• On the edge-tenacity of graphs
• Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
• Tenacity of a graph with maximum connectivity
• Computing the tenacity of some graphs
• Isolation of connected graphs
• scientific article; zbMATH DE number 4093511
• The neighbour-integrity of total graphs

Cites work

• A survey of integrity
• Edge-neighbor-rupture degree of graphs
• Edge‐tenacious networks
• Graph Classes: A Survey
• Graph operations and neighbor-integrity.
• scientific article; zbMATH DE number 4158656 (Why is no real title available?)
• scientific article; zbMATH DE number 718660 (Why is no real title available?)
• scientific article; zbMATH DE number 1109405 (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?)
• Neighbour-connectivity in regular graphs
• On a class of posets and the corresponding comparability graphs
• On the edge-tenacity of graphs
• Tenacity of a graph with maximum connectivity
• Tenacity of total graphs
• The isolated scattering number of graphs
• The Size of a Minimum Critically m-Neighbor-Scattered Graph
• Vertex-neighbor-integrity of powers of cycles
• Vertex-neighbor-scattering number of graphs.
• Vertex-neighbour-integrity of composition graphs of paths and cycles

Cited in

(7)

• A fast numerical method for fractional partial integro-differential equations with spatial-time delays
• Tree-core and tree-coritivity of graphs
• scientific article; zbMATH DE number 7404149 (Why is no real title available?)
• Neighbor toughness of graphs
• Neighbor rupture degree of transformation graphs \(G^{xy-}\)
• A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
• Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time

This page was built for publication: Neighbor Isolated Tenacity of Graphs

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