Edge Neighbor Connectivity of FQ_n
FU Xin-rong · Journal of Guangxi Teachers Education University · 2009
FQn is one of the most famous network models.Let e be an edge of a graph G,We say that e is subverted,if the double star with e being its center is deleted from G.Let S be an edge set.If every edge in S is subverted,and the surviving graph is either disconnected or a single vertex or empty,then S is called to be an edge cut strategy.The number of edges in a minimum edge cut strategy is defined to be the edge neighbor connectivity.In this paper,we prove that the edge neighbor connectivity of FQn is n.