Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Bounding neighbor-connectivity of Abelian Cayley graphs

Lynne L. Doty — 2011

Discussiones Mathematicae Graph Theory

For the notion of neighbor-connectivity in graphs whenever a vertex is subverted the entire closed neighborhood of the vertex is deleted from the graph. The minimum number of vertices whose subversion results in an empty, complete, or disconnected subgraph is called the neighbor-connectivity of the graph. Gunther, Hartnell, and Nowakowski have shown that for any graph, neighbor-connectivity is bounded above by κ. Doty has sharpened that bound in abelian Cayley graphs to approximately (1/2)κ. The...

Page 1

Download Results (CSV)