Let G be a simple graph with 2n vertices and a perfect matching.The forcing number f(G,M) of a perfect matching M of G is the smallest cardinality of a subset of M that is contained in no other perfect matching of G.A...Let G be a simple graph with 2n vertices and a perfect matching.The forcing number f(G,M) of a perfect matching M of G is the smallest cardinality of a subset of M that is contained in no other perfect matching of G.Among all perfect matchings M of G,the minimum and maximum values of f(G,M) are called the minimum and maximum forcing numbers of G,denoted by f(G) and F(G),respectively.Then f(G)≤F(G) ≤n-1.Che and Chen(2011) proposed an open problem:how to characterize the graphs G with f(G)=n-1.Later they showed that for a bipartite graph G,f(G)=n-1 if and only if G is complete bipartite graph K_(n,n).In this paper,we completely solve the problem of Che and Chen,and show that f(G)=n-1 if and only if G is a complete multipartite graph or a graph obtained from complete bipartite graph K_(n,n) by adding arbitrary edges in one partite set.For all graphs G with F(G)=n-1,we prove that the forcing spectrum of each such graph G forms an integer interval by matching 2-switches and the minimum forcing numbers of all such graphs G form an integer interval from [n/2] to n-1.展开更多
The metric dimension dim（G） of a graph G is the minimum number of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices. The zero forcing number Z（G） of a gr...The metric dimension dim（G） of a graph G is the minimum number of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices. The zero forcing number Z（G） of a graph G is the minimum eardinality of a set S of black vertices （whereas vertices in V（G）／S are colored white） such that V（G） is turned black after finitely many applications of ＂the color-change rule＂： a white vertex is converted black if it is the only white neighbor of a black vertex. We show that dim（T） ≤Z（T） for a tree T, and that dim（G）≤Z（G）＋I if G is a unicyclic graph; along the way, we characterize trees T attaining dim（T） = Z（T）. For a general graph G, we introduce the ＂cycle rank conjecture＂. We conclude with a proof of dim（T） - 2 ≤ dim（T ＋ e） ≤dim（T） ＋ 1 for e∈ E（T）.展开更多
A narrow strip is used to control mean and fluctuating forces on a circular cylinder at Reynolds numbers from 2.0 ×10^4 to 1.0 ×^ 10^5. The axes of the strip and cylinder are parallel. The control parameters...A narrow strip is used to control mean and fluctuating forces on a circular cylinder at Reynolds numbers from 2.0 ×10^4 to 1.0 ×^ 10^5. The axes of the strip and cylinder are parallel. The control parameters are strip width ratio and strip position characterized by angle of attack and distance from the cylinder. Wind tunnel tests show that the vortex shedding from both sides of the cylinder can be suppressed, and mean drag and fluctuating lift on the cylinder can be reduced if the strip is installed in an effective zone downstream of the cylinder. A phenomenon of mono-side vortex shedding is found. The strip-induced local changes of velocity profiles in the near wake of the cylinder are measured, and the relation between base suction and peak value in the power spectrum of fluctuating lift is studied. The control mechanism is then discussed from different points of view.展开更多
Based on nonlinear Mohr-Coulomb failure criterion, the analytical solutions of stability number and supporting force on twin shallow tunnels were derived using upper bound theorem of limit analysis. The optimized solu...Based on nonlinear Mohr-Coulomb failure criterion, the analytical solutions of stability number and supporting force on twin shallow tunnels were derived using upper bound theorem of limit analysis. The optimized solutions were obtained by the technique of sequential quadratic programming. When nonlinear coefficient equals 1 and internal friction angle equals 0, the nonlinear Mohr-Coulomb failure criterion degenerates into linear failure criterion. The calculated results of stability number in this work were compared with previous results, and the agreement verifies the effectiveness of the present method. Under the condition of nonlinear Mohr-Coulomb failure criterion, the results show that the supporting force on twin shallow tunnels obviously increases when the nonlinear coefficient, burial depth, ground load or pore water pressure coefficients increase. When the clear distance is 0.5to 1.0 times the diameter of tunnel, the supporting force of twin shallow tunnels reaches its maximum value, which means that the tunnels are the easiest to collapse. While the clear distance increases to 3.5 times the diameter of tunnel, the calculation for twin shallow tunnels can be carried out by the method for independent single shallow tunnel. Therefore, 3.5 times the diameter of tunnel serves as a critical value to determine whether twin shallow tunnels influence each other. In designing twin shallow tunnels,appropriate clear distance value must be selected according to its change rules and actual topographic conditions, meanwhile, the influences of nonlinear failure criterion of soil materials and pore water must be completely considered. During the excavation process, supporting system should be intensified at the positions of larger burial depth or ground load to avoid collapses.展开更多
Let G be a graph that admits a perfect matching M.A forcing set S for a perfect matching M is a subset of M such that it is contained in no other perfect matchings of G.The cardinality of a forcing set of M with the s...Let G be a graph that admits a perfect matching M.A forcing set S for a perfect matching M is a subset of M such that it is contained in no other perfect matchings of G.The cardinality of a forcing set of M with the smallest size is called the forcing number of M,denoted by f(G,M).The forcing spectrum of G is defined as:Spec(G)={f(G,M)|M is a perfect matching of G}.In this paper,by applying the Ztransformation graph(resonance graph)we show that for any polyomino with perfect matchings and any even polygonal chain,their forcing spectra are integral intervals.Further we obtain some sharp bounds on maximum and minimum forcing numbers of hexagonal chains with given number of kinks.Forcing spectra of two extremal chains are determined.展开更多
基金Supported by National Natural Science Foundation of China (Grant No. 12271229)Gansu Provincial Department of Education:Youth Doctoral fund project (Grant No. 2021QB-090)。
文摘Let G be a simple graph with 2n vertices and a perfect matching.The forcing number f(G,M) of a perfect matching M of G is the smallest cardinality of a subset of M that is contained in no other perfect matching of G.Among all perfect matchings M of G,the minimum and maximum values of f(G,M) are called the minimum and maximum forcing numbers of G,denoted by f(G) and F(G),respectively.Then f(G)≤F(G) ≤n-1.Che and Chen(2011) proposed an open problem:how to characterize the graphs G with f(G)=n-1.Later they showed that for a bipartite graph G,f(G)=n-1 if and only if G is complete bipartite graph K_(n,n).In this paper,we completely solve the problem of Che and Chen,and show that f(G)=n-1 if and only if G is a complete multipartite graph or a graph obtained from complete bipartite graph K_(n,n) by adding arbitrary edges in one partite set.For all graphs G with F(G)=n-1,we prove that the forcing spectrum of each such graph G forms an integer interval by matching 2-switches and the minimum forcing numbers of all such graphs G form an integer interval from [n/2] to n-1.
文摘The metric dimension dim（G） of a graph G is the minimum number of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices. The zero forcing number Z（G） of a graph G is the minimum eardinality of a set S of black vertices （whereas vertices in V（G）／S are colored white） such that V（G） is turned black after finitely many applications of ＂the color-change rule＂： a white vertex is converted black if it is the only white neighbor of a black vertex. We show that dim（T） ≤Z（T） for a tree T, and that dim（G）≤Z（G）＋I if G is a unicyclic graph; along the way, we characterize trees T attaining dim（T） = Z（T）. For a general graph G, we introduce the ＂cycle rank conjecture＂. We conclude with a proof of dim（T） - 2 ≤ dim（T ＋ e） ≤dim（T） ＋ 1 for e∈ E（T）.
基金the National Natural Science Foundation of China(10172087 and 10472124).
文摘A narrow strip is used to control mean and fluctuating forces on a circular cylinder at Reynolds numbers from 2.0 ×10^4 to 1.0 ×^ 10^5. The axes of the strip and cylinder are parallel. The control parameters are strip width ratio and strip position characterized by angle of attack and distance from the cylinder. Wind tunnel tests show that the vortex shedding from both sides of the cylinder can be suppressed, and mean drag and fluctuating lift on the cylinder can be reduced if the strip is installed in an effective zone downstream of the cylinder. A phenomenon of mono-side vortex shedding is found. The strip-induced local changes of velocity profiles in the near wake of the cylinder are measured, and the relation between base suction and peak value in the power spectrum of fluctuating lift is studied. The control mechanism is then discussed from different points of view.
基金Project(2013CB036004)supported by the National Basic Research Program of ChinaProject(51378510)supported by the NationalNatural Science Foundation of ChinaProject(CX2013B077)supported by Hunan Provincial Innovation Foundation for Postgraduate,China
文摘Based on nonlinear Mohr-Coulomb failure criterion, the analytical solutions of stability number and supporting force on twin shallow tunnels were derived using upper bound theorem of limit analysis. The optimized solutions were obtained by the technique of sequential quadratic programming. When nonlinear coefficient equals 1 and internal friction angle equals 0, the nonlinear Mohr-Coulomb failure criterion degenerates into linear failure criterion. The calculated results of stability number in this work were compared with previous results, and the agreement verifies the effectiveness of the present method. Under the condition of nonlinear Mohr-Coulomb failure criterion, the results show that the supporting force on twin shallow tunnels obviously increases when the nonlinear coefficient, burial depth, ground load or pore water pressure coefficients increase. When the clear distance is 0.5to 1.0 times the diameter of tunnel, the supporting force of twin shallow tunnels reaches its maximum value, which means that the tunnels are the easiest to collapse. While the clear distance increases to 3.5 times the diameter of tunnel, the calculation for twin shallow tunnels can be carried out by the method for independent single shallow tunnel. Therefore, 3.5 times the diameter of tunnel serves as a critical value to determine whether twin shallow tunnels influence each other. In designing twin shallow tunnels,appropriate clear distance value must be selected according to its change rules and actual topographic conditions, meanwhile, the influences of nonlinear failure criterion of soil materials and pore water must be completely considered. During the excavation process, supporting system should be intensified at the positions of larger burial depth or ground load to avoid collapses.
基金supported by the National Natural Science Foundation of China(Nos.11871256,11371180,11226286)。
文摘Let G be a graph that admits a perfect matching M.A forcing set S for a perfect matching M is a subset of M such that it is contained in no other perfect matchings of G.The cardinality of a forcing set of M with the smallest size is called the forcing number of M,denoted by f(G,M).The forcing spectrum of G is defined as:Spec(G)={f(G,M)|M is a perfect matching of G}.In this paper,by applying the Ztransformation graph(resonance graph)we show that for any polyomino with perfect matchings and any even polygonal chain,their forcing spectra are integral intervals.Further we obtain some sharp bounds on maximum and minimum forcing numbers of hexagonal chains with given number of kinks.Forcing spectra of two extremal chains are determined.
