Let G be a simple graph. The size of any largest matching in G is called the matching number of G and is denoted by ν(G). Define the deficiency of G, def(G), by the equation def(G)=|V(G)|−2ν(G). A set of points X in G is called an extreme set if def(G−X)=def(G)+|X|. Let c0(G) denote the number of the odd components of G. A set of points X in G is called a barrier if c0(G−X)=def(G)+|X|. In this paper, we obtain the following:
(1) Let G be a simple graph containing an independent set of size i, where i2. If X is extreme in G for every independent set X of size i in G, then there exists a perfect matching in G.
(2) Let G be a connected simple graph containing an independent set of size i, where i2. Then X is extreme in G for every independent set X of size i in G if and only if G=(U,W) is a bipartite graph with |U|=|W|i, and |Γ(Y)||U|−i+m+1 for any Y U, |Y|=m (1mi−1).
(3) Let G be a connected simple graph containing an independent set of size i, where i2. Then X is a barrier in G for every independent set X of size i in G if and only if G=(U,W) is a bipartite graph with |U|=|W|=i, and |Γ(Y)|m+1 for any Y U, |Y|=m (1mi−1). 相似文献
In this article, we show that for any positive integer k there is a 3-generator, 3-relation finite 2-group of class (respectively, coclass) k provided that k ≥ 4 (respectively, k ≥ 5). 相似文献
Using computational methods, we first show that there are exactly eighteen 3-generator 2-groups of order 210 with trivial Schur multiplier all having deficiency zero. We next generalize one of the groups obtained to exhibit two infinite classes of 3-generator, 3-relation finite 2-groups of high nilpotency class providing an affirmative answer to a problem posed by Havas et al. 相似文献
A proper edge coloring c:E(G)→Z of a finite simple graph G is an interval coloring if the colors used at each vertex form a consecutive interval of integers. Many graphs do not have interval colorings, and the deficiency of a graph is an invariant that measures how close a graph comes to having an interval coloring. In this paper we search for tight upper bounds on the deficiencies of k-regular graphs in terms of the number of vertices. We find exact values for 1?k?4 and bounds for larger k. 相似文献
This paper was designed to study metabonomic characters of the ‘Kidney-Yang Deficiency syndrome’ induced by high dose of hydrocortisone and the therapeutic effects of Rhizoma Drynariae, classic traditional Chinese medicine (TCM) in treating the syndrome. A urinary metabonomics method based on ultra-performance liquid chromatography coupled with mass spectrometry (UPLC/MS) was developed. The significant difference in metabolic profiling was observed from model group (hydrocortisone-induced group) compared with the pre-dose group (rats before hydrocortisone inducing) by using the principal components analysis (PCA). The time-dependent regression tendency in Rhizoma Drynariae treatment group (hydrocortisone-induced rats followed by being administered with Rhizoma Drynariae ethanol extracts) from day 3 to 15 was obtained, indicating the time-dependent recovery effect of Rhizoma Drynariae on ‘Kidney-Yang Deficiency syndrome’ rats. Some significantly changed metabolites like phenylalanine, phenylacetylglycine, N2-succinyl-l-ornithine, l-proline, creatinine, hippurate and citrate have been identified. These biochemical changes are related to the disturbance in energy metabolism, amino acid metabolism and gut microflora, which are helpful to further understand the ‘Kidney-Yang Deficiency syndrome’ and the therapeutic mechanism of Rhizoma Drynariae. The work shows that the metabonomics method is a valuable tool for studying the essence of Chinese medicine's syndrome theory and therapeutic effect mechanism of TCM. 相似文献
The quantity deficiency which was proposed by Hodges and Lehmann (1970) is used to compare different statistical procedures. In this article, the deficiency of the sample quantile estimator with respect to the kernel quantile estimator for left truncated and right censored (LTRC) data in the sense of Hodges and Lehmann is considered. We also give the optimal bandwidth for the kernel quantile estimator. Monte Carlo studies are conducted to illustrate our results. 相似文献