Recommendations
Cites work
- A survey of integrity
- A toughness condition for fractional \((k, m)\)-deleted graphs revisited
- Graph theory with applications
- scientific article; zbMATH DE number 4139795 (Why is no real title available?)
- scientific article; zbMATH DE number 4162911 (Why is no real title available?)
- scientific article; zbMATH DE number 4043858 (Why is no real title available?)
- scientific article; zbMATH DE number 4053662 (Why is no real title available?)
- scientific article; zbMATH DE number 4085694 (Why is no real title available?)
- scientific article; zbMATH DE number 3777553 (Why is no real title available?)
- scientific article; zbMATH DE number 1529465 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On the total closed neighbourhood graph of a graph
- Sur le coloriage des graphs
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
Cited in
(10)- A survey of integrity
- Stability measures of some static interconnection networks
- Vulnerability: integrity of a middle graph
- The neighbour-integrity of boolean graphs and its compounds
- Integrity of total transformation graphs
- Uniform integrity of graphs
- Integrity of total graphs via certain parameters
- Integrity of quasi-total graphs
- Application of double domination integrity in PMU placement problem
- Vertex vulnerability in wrapped butterfly network
This page was built for publication: Integrity of graph operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958095)
