Removable Edges in Cycles of a k-Connected Graph

An edge e of a k-connected graph G is said to be a removable edge if G e is still kconnected, where G e denotes the graph obtained from G by deleting e to get G - e, and for any end vertex of e with degree k - 1 in G - e, say x, delete x, and then add edges between any pair of non-adjacent vertices in NG-e（x）. The existence of removable edges of k-connected graphs and some properties of 3-connected graphs and 4-connected graphs have been investigated. In the present paper, we investigate some properties of k-connected graphs and study the distribution of removable edges on a cycle in a k-connected graph （k ≥ 4）.

Removable Edges in a Spanning Tree of a k-connected Graph

An edge e of a k-connected graph G is said to be a removable edge if G O e is still k-connected, where G O e denotes the graph obtained from G by the following way： deleting e to get G - e, and for any end vertex of e with degree k - 1 in G - e, say x, deleting x, and then adding edges between any pair of non-adjacent vertices in NG-e （x）. The existence of removable edges of k-connected graphs and some properties of k-connected graphs have been investigated. In the present paper, we investigate the distribution of removable edges on a spanning tree of a k-connected graph （k ≥ 4）.

Removable Edges in a 5-Connected Graph

An edge e of a k-connected graph G is said to be a removable edge if G O e is still k-connected, where G e denotes the graph obtained from G by deleting e to get G - e, and for any end vertex of e with degree k - 1 in G- e, say x, delete x, and then add edges between any pair of non-adjacent vertices in NG-e （x）. The existence of removable edges of k-connected graphs and some properties of 3-connected and 4-connected graphs have been investigated [1, 11, 14, 15]. In the present paper, we investigate some properties of 5-connected graphs and study the distribution of removable edges on a cycle and a spanning tree in a 5- connected graph. Based on the properties, we proved that for a 5-connected graph G of order at least 10, if the edge-vertex-atom of G contains at least three vertices, then G has at least （3│G│ ＋ 2）/2 removable edges.

Influence of network structure on spreading dynamics via tie range

There are various phenomena of malicious information spreading in the real society, which cause many negative impacts on the society. In order to better control the spreading, it is crucial to reveal the influence of network structure on network spreading. Motifs, as fundamental structures within a network, play a significant role in spreading. Therefore, it is of interest to investigate the influence of the structural characteristics of basic network motifs on spreading dynamics.Considering the edges of the basic network motifs in an undirected network correspond to different tie ranges, two edge removal strategies are proposed, short ties priority removal strategy and long ties priority removal strategy. The tie range represents the second shortest path length between two connected nodes. The study focuses on analyzing how the proposed strategies impact network spreading and network structure, as well as examining the influence of network structure on network spreading. Our findings indicate that the long ties priority removal strategy is most effective in controlling network spreading, especially in terms of spread range and spread velocity. In terms of network structure, the clustering coefficient and the diameter of network also have an effect on the network spreading, and the triangular structure as an important motif structure effectively inhibits the spreading.

Influence of Selective Edge Removal and Refractory Period in a Self-Organized Critical Neuron Model

A simple model for a set of integrate-and-fire neurons based on the weighted network is introduced. By considering the neurobiological phenomenon in brain development and the difference of the synaptic strength, we construct weighted networks develop with link additions and followed by selective edge removal. The network exhibits the small-world and scale-free properties with high network efficiency. The model displays an avalanche activity on a power-law distribution. We investigate the effect of selective edge removal and the neuron refractory period on the self-organized criticality of the system.

REMOVABLE EARS OF 1-EXTENDABLE GRAPHS

Carvalho, Lucchesi and Murty proved that any 1-extendable graph G different from K2 and C2n has at least A（G） edge-disjoint removable ears, and any brick G distinct from K4 and C6 has at least A（G） - 2 removable edges, where A（G） denotes the maximum degree of G. In this paper, we improve the lower bounds for numbers of removable ears and removable edges of 1-extendable graphs. It is proved that any 1-extendable graph G different from K2 and C2n has at least x′（G） edge-disjoint removable ears, and any brick G distinct from Ka and Ce has at least x′（G） - 2 removable edges, where x′（G） denotes the edge-chromatic number of G. Key words 1-extendable graphs, removable ear, removable edge.