Integrity of graph operations
From MaRDI portal
Publication:4958095
DOI10.22108/TOC.2021.121736.1710zbMATH Open1488.05279OpenAlexW4287005328MaRDI QIDQ4958095FDOQ4958095
Authors: B. Basavanagoud, Shruti Policepatil, Praveen Jakkannavar
Publication date: 6 September 2021
Full work available at URL: https://doaj.org/article/85454cd6e30d4463921998bb213a2c0a
Recommendations
Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76) Communication networks in operations research (90B18)
Cites Work
- Sur le coloriage des graphs
- Graph theory with applications
- Title not available (Why is that?)
- A survey of integrity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A toughness condition for fractional \((k, m)\)-deleted graphs revisited
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
- On the total closed neighbourhood graph of a graph
- Title not available (Why is that?)
Cited In (8)
- The neighbour-integrity of boolean graphs and its compounds
- Vulnerability: integrity of a middle graph
- Integrity of total graphs via certain parameters
- Uniform integrity of graphs
- Integrity of total transformation graphs
- Integrity of quasi-total graphs
- A survey of integrity
- Stability measures of some static interconnection networks
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)