共查询到20条相似文献,搜索用时 31 毫秒
1.
证明了实数域上(n-1)-半单的(n+1)维n-李代数A是n维欧氏空间的Lorentz群O(p,n-p)与n维Abel正规子群的半直积的n-李代数.且当p=0时,A是n维欧氏空间的等距变换群的n-李代数.并提出了关于(n-1)-半单的(n+1)维n-李代数的外导子的物理应用与几何应用问题. 相似文献
2.
3.
用K(s,n)表示完全图Kn的一条边被长为s(s≥2)的路Ps+1替代后得到的图.对n≥7,且n-2为素数,刻画了色等价类【K(s,n)]中图的结构特征,进一步,证明了任意任意n≥7,且n-2为素数,K(2,n),K(3,n)是色唯一的. 相似文献
4.
如果n是正整数,我们用f(n)表示丢番图方程4/p=1/n_1+1/n_2+1/n_3的正整数解(n1,n2,n3)的个数.对于素数p,f(p)可以分解为f1(p)+f2(p),这里fi(p)(i=1,2)为分母n1,n2,n3中恰有i个能被p整除的解的个数.本文我们将研究关于均值∑p〈xfi(p),i=1,2,的估计,其中p表示素数. 相似文献
5.
设G是一个图,n,k和d是三个非负整数,满足n+2k+d≤|V(G)|-2,|V(G)|和n+d有相同的奇偶性.如果删去G中任意n个点后所得的图有k-匹配,并且任一k-匹配都可以扩充为一个亏d-匹配,那么称G是一个(n,k,d)-图.Liu和Yu[1]首先引入了(n,k,d)-图的概念,并且给出了(n,k,d)-图的一个刻划和若干性质. (0,k,1)-图也称为几乎k-可扩图.在本文中,作者改进了(n,k,d)-图的刻划,并给出了几乎k-可扩图和几乎k-可扩二部图的刻划,进而研究了几乎k-可扩图与n-因子临界图之间的关系. 相似文献
6.
设P是n-立方体图Q_n的完备控制集.在1994年,Weichsel证明了存在某些整数r_1,r_2,…,r_m使P在Q n中的诱导子图〈P〉为Q_(r1),Q_(r2),…,Q_(rm)的不交之并,并且猜想r_1=r_2=…=r_m.本文证明了当m≤20时,该猜想正确. 相似文献
7.
令简单图G=(V,E)是有p个顶点q条边的图.假设G的顶点和边由1,2,…,p+q所标号,且f:V ∪E→{1,2,…,p+q}是一个双射,如果对所有的边xy,f(x)+f(y)+f(xy)是常量,则称图G是边幻图(edge-magic).本文证明了三路树P(m,n,t)当n为偶数,t=n+2时也是边幻图. 相似文献
8.
令简单图G=(V,E)是有p个顶点q条边的图.假设G的顶点和边由1,2,…,p+q所标号,且f:V∪E→{1,2,…,p+q}是一个双射,如果对所有的边xy,f(x)+f(y)+f(xy)是常量,则称图G是边幻图(edge-magic).本文证明了三路树P(m,n,t)当n为偶数,t=n+2时也是边幻图. 相似文献
9.
若干图的广义Mycielski图的边色数 总被引:2,自引:1,他引:1
设图G(V,E)为简单图,V(Mn(G))={v01,v02,…,v0p;v11,v12,…,v1p;…,vn1,vn2,…,vnp}EMn(G))=E(G)∪vijv(i+1)kv0 jv0k∈E(G),1 j,k p,i=0,1,…,n-1称Mn(G)为G的n串广义M ycielsk i图,其中n为自然数,V(G)={v01,v02,…,v0p}.本文得到了路、圈、扇、轮、星图的广义M ycielsk i图的边色数. 相似文献
10.
11.
A graph is perfect if the chromatic number is equal to the clique number for every induced subgraph of the graph. Perfect graphs were defined by Berge in the sixties. In this survey we present known results about partial characterizations by forbidden induced subgraphs of different graph classes related to perfect graphs. We analyze a variation of perfect graphs, clique-perfect graphs, and two subclasses of perfect graphs, coordinated graphs and balanced graphs. 相似文献
12.
P.S. Ranjini 《Applied mathematics and computation》2011,218(3):699-702
The aim of this paper is to investigate the Zagreb indices of the line graphs of the tadpole graphs, wheel graphs and ladder graphs using the subdivision concepts. 相似文献
13.
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique-transversal number and clique-independence number of G are the sizes of a minimum clique-transversal and a maximum clique-independent set of G, respectively. A graph G is clique-perfect if these two numbers are equal for every induced subgraph of G. The list of minimal forbidden induced subgraphs for the class of clique-perfect graphs is not known. In this paper, we present a partial result in this direction; that is, we characterize clique-perfect graphs by a restricted list of forbidden induced subgraphs when the graph belongs to two different subclasses of claw-free graphs. 相似文献
14.
Flavia Bonomo Guillermo Durán Martín D. Safe Annegret K. Wagler 《Discrete Applied Mathematics》2013,161(13-14):1925-1942
A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs that belong to one of the following graph classes: complements of bipartite graphs, line graphs of multigraphs, and complements of line graphs of multigraphs. These characterizations lead to linear-time recognition algorithms for balanced graphs within the same three graph classes. 相似文献
15.
Zsolt Patakfalvi 《Discrete Mathematics》2008,308(12):2351-2365
A graph is called normal if its vertex set can be covered by cliques Q1,Q2,…,Qk and also by stable sets S1,S2,…,Sl, such that Si∩Qj≠∅ for every i,j. This notion is due to Körner, who introduced the class of normal graphs as an extension of the class of perfect graphs. Normality has also relevance in information theory. Here we prove, that the line graphs of cubic graphs are normal. 相似文献
16.
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. A graph G is clique-perfect if the sizes of a minimum clique-transversal and a maximum clique-independent set are equal for every induced subgraph of G. The list of minimal forbidden induced subgraphs for the class of clique-perfect graphs is not known. Another open question concerning clique-perfect graphs is the complexity of the recognition problem. Recently we were able to characterize clique-perfect graphs by a restricted list of forbidden induced subgraphs when the graph belongs to two different subclasses of claw-free graphs. These characterizations lead to polynomial time recognition of clique-perfect graphs in these classes of graphs. In this paper we solve the characterization problem in two new classes of graphs: diamond-free and Helly circular-arc () graphs. This last characterization leads to a polynomial time recognition algorithm for clique-perfect graphs. 相似文献
17.
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. A graph G is called conservative if it admits an orientation and a labelling of the edges by integers {1,…,|E(G)|} such that at each vertex the sum of the labels on the incoming edges is equal to the sum of the labels on the outgoing edges. In this paper we deal with conservative graphs and their connection with the supermagic graphs. We introduce a new method to construct supermagic graphs using conservative graphs. Inter alia we show that the union of some circulant graphs and regular complete multipartite graphs are supermagic. 相似文献
18.
The subject of this paper are infinite, locally finite, vertex-transitive median graphs. It is shown that the finiteness of
the Θ-classes of such graphs does not guarantee finite blocks. Blocks become finite if, in addition, no finite sequence of
Θ-contractions produces new cut-vertices. It is proved that there are only finitely many vertex-transitive median graphs of
given finite degree with finite blocks. An infinite family of vertex-transitive median graphs with finite intransitive blocks
is also constructed and the list of vertex-transitive median graphs of degree four is presented.
Sandi Klavžar: Supported by the Ministry of Science of Slovenia under the grant P1-0297. The author is also with the Faculty
of Mathematics and Natural Sciences, University of Maribor, Slovenia and the Institute of Mathematics, Physics and Mechanics,
Ljubljana. 相似文献
19.
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with δ(G)?5, then G is collapsible, and of course supereulerian. This bound is best possible. 相似文献