共查询到20条相似文献,搜索用时 375 毫秒
1.
《数学的实践与认识》2020,(15)
图G的标号是指G的顶点集到一个整数集的映射f,且对e=uv∈E(G)由f(u)和f(v)诱导出边e的标号f(uv).本文给出了二分奇优美图的概念,证明了一个图是二分奇优美的当且仅当它是二分优美的,并给出了一些构造奇优美图的方法. 相似文献
3.
给出了奇优美图和二分奇优美图的概念,并定义了金鱼图,证明了在鱼头为不同图形的情况下,金鱼图仍然是奇优美的,且是二分奇优美的.还证明了:对一个奇优美图H和一棵二分奇优美树T,用一条边连接T的一个顶点和H的标号基点u_0后所得到的金鱼图仍是奇优美图. 相似文献
4.
具有完美匹配M的n阶树T是强优美的,如果对任意uv∈M,存在树T的一个优美标号f,使得f(u)+f(u)=n-1.给出了二分奇优美树和强优美树的概念,证明了斐波纳契对虾树是二分奇优美和强优美树. 相似文献
5.
6.
林育青 《纯粹数学与应用数学》2017,33(1)
该文定义了图(C)2n,并研究了该图的奇优美和奇强协调性.利用构造法分别给出了图(C)2n在n=4k(k≥2)、n=4k+2时的奇优美算法,在n=4kk≥2)时,的奇强协调算法,进而证明了图(C)2n在n=2k(k≥3)时是奇优美图,在n=4k(k≥2)时是奇强协调图等结论,从而推动了对图的奇优美性和奇强协调性的研究.最后提出猜想:当n=4k+2时,图(C)2n不是奇强协调图. 相似文献
7.
关于图P3n优美性的研究 总被引:6,自引:0,他引:6
在n个顶点的路Pn上,当且仅当两点的距离为3时增加一条边,所得的图称为P3n,本文给出了图P3n(n≥4)的优美标号,从而证明了P3n都是优美图. 相似文献
8.
《数学的实践与认识》2015,(18)
设k_1,k_2,…,k_n是非负整数,C_n=v_v_2…v_nv_1是有n个顶点n条边的圈,则称图C_n+{v_1v_(11),v_1v_(12),…,v_1v_1k_1,v_2v_(21),…,v_2k_2,…,v_nv_(n1),…,v_nk_n}为(k_1,k_2,…,k_n)轮环图,简记为C(k_1,k_1,…,k_n).研究了太阳图1C_n的奇优美性及其奇强协调性,得到了太阳图1C_n在n为偶数时的奇优美标号算法和奇强协调标号算法,从而证明了太阳图1C_n在n为偶数时是奇优美图和奇强协调图的结论. 相似文献
9.
《纯粹数学与应用数学》2017,(1)
该文定义了图_n~2,并研究了该图的奇优美和奇强协调性.利用构造法分别给出了图_n~2在n=4k(k≥2)、n=4k+2时的奇优美算法,在n=4k(k≥2)时,的奇强协调算法,进而证明了图_n~2在n=2k(k≥3)时是奇优美图,在n=4k(k≥2)时是奇强协调图等结论,从而推动了对图的奇优美性和奇强协调性的研究.最后提出猜想:当n=4k+2时,图_n~2不是奇强协调图. 相似文献
10.
图Cn及其r-冠的新的优美标号 总被引:9,自引:0,他引:9
胡红亮 《纯粹数学与应用数学》2010,26(3):454-457
研究了关于图的r-冠的优美标号的一个问题,证明了:当n≡0,3(mod 4)时,图Cn及其r-冠是优美图,所给出的新的优美标号不同于现有文献中得到的结果.进而证明了当n≡0(mod 4)时,图Cn及其r-冠也是交错图. 相似文献
11.
In this paper we determine the minimum and maximum values of the sum of squares of degrees of bipartite graphs with a given number of vertices and edges. 相似文献
12.
Jogi Henna 《Annals of the Institute of Statistical Mathematics》2005,57(4):655-664
An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation
of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case
of finite mixtures of two-dimensional normal distributions. 相似文献
13.
14.
Nguyêñ Quoôć Thǎ;ńg 《代数通讯》2013,41(3):1097-1110
We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups. 相似文献
15.
Piotr Je¸drzejewicz 《代数通讯》2013,41(4):1500-1508
Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing Ap. 相似文献
16.
N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès. 相似文献
17.
Janusz Sokó? 《Journal of Mathematical Analysis and Applications》2008,344(2):869-875
We consider the classes of analytic functions introduced recently by K.I. Noor which are defined by conditions joining ideas of close-to-convex and of bounded boundary rotation functions. We investigate coefficients estimates and radii of convexity. 相似文献
18.
有资格限制的指派问题的求解方法 总被引:3,自引:0,他引:3
在实际的指派工作中,常会遇到某个人有没有资格去承担某项工作的问题,因此,本建立了有资格限制的指派问题的数学模型。在此数学模型中,将效益矩阵转化为判定矩阵,由此给出了判定此种指派问题是否有解的方法;在有解的情况下,进一步将效益矩阵转化为求解矩阵,从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。 相似文献
19.
20.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献