Neighbour-connectivity in regular graphs
From MaRDI portal
The author gives another generalization of point-connectivity in removing closed neighbourhoods of vertices instead of only vertices. He calls a graph k-neighbour connected, if for any choice of k vertices and then removing these vertices and their neighbours the survival-subgraph is connected and not a clique (a complete subgraph). Then he gives a complete characterization of the class of graphs which are k-regular, contain a k-clique, are k-neighbour connected and are of order \(k^ 2+k\).
Recommendations
Cites work
- A general class of invulnerable graphs
- scientific article; zbMATH DE number 3668616 (Why is no real title available?)
- scientific article; zbMATH DE number 3689449 (Why is no real title available?)
- scientific article; zbMATH DE number 3477199 (Why is no real title available?)
- scientific article; zbMATH DE number 3628999 (Why is no real title available?)
- On Designing a Reliable Hierarchical Structure
- Optimal K-secure graphs
Cited in
(27)- On minimal neighbourhood-connected graphs
- The structure of neighbor disconnected vertex transitive graphs
- A polynomial algorithm of edge-neighbor-scattering number of trees
- Neighbor connectivity of two kinds of Cayley graphs
- Neighbor connectivity of pancake graphs and burnt pancake graphs
- Neighbor-connectivity of pancake networks and burnt pancake networks
- A new bound for neighbor-connectivity of abelian Cayley graphs
- Vertex-neighbor-scattering number of bipartite graphs
- Neighbor Isolated Tenacity of Graphs
- scientific article; zbMATH DE number 4031742 (Why is no real title available?)
- scientific article; zbMATH DE number 4049682 (Why is no real title available?)
- scientific article; zbMATH DE number 867625 (Why is no real title available?)
- A brief account on the development and future research directions of connectivity properties of interconnection networks
- Neighbor rupture degree of Harary graphs
- Neighbor rupture degree of transformation graphs \(G^{xy-}\)
- A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
- Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
- A linear algorithm for the neighbor-component order connectivity of arbitrary trees
- Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs
- Neighbor connectivity of bubble-sort star graphs
- Neighbor connectivity of hypercube-based compound network
- Neighbor connectivity of undirected toroidal meshes
- Conditional (edge) neighbor connectivity of hierarchical star networks
- Neighbor connectivity of hierarchical pancake networks
- An upper bound for neighbor-connectivity of graphs
- \(K_{1,r}\)-structure connectivity and neighbor connectivity in hierarchical networks
- Galaxy cutsets in graphs
This page was built for publication: Neighbour-connectivity in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1074600)