共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
5.
试图对6度1-正则Cayley图给一个完全分类.利用无核的概念将图自同构群归结到对称群S6的子群.然后根据1-正则图的性质构造出所有可能的具有非交换点稳定子群的无核6度1-正则Cayley图,进一步证明了构造出的图都是有核的,由此给出了这一类图的一个完全分类. 相似文献
6.
图G的一个顶点称为割点是指删去该顶点,图的分支数增加,而图G的一个末块是指仅包含G的一个割点的块.对无爪且不含4-团的4-正则图,给出了它的末块数与割点数的上界且刻划了达到这些上界的极值图. 相似文献
7.
2-图是边的尺寸至多为2的超图,极小正则2-图是不含有真正则因子的正则2-图. 设f2(n)为所有n个顶点的极小正则2-图的最大度数.给出了极小正则2-图的一个结构性质,并由此证得 f2(n) =(n+3-i)/3, 其中1≤i≤6, n≥7, i≡n(mod 6),从而解决了范红兵等人提出的一个猜想. 作为在图论中的应用, 可以刻画不可分解因子的正则图, 并给出关于度条件的最好可能的因子存在性定理. 进而, f2(n)和极小2-图可应用于最初引发这项研究的通用开关盒设计问题. 相似文献
8.
盛集明 《数学的实践与认识》2010,40(1)
图的各种连通度概念被先后用来研究网络可靠性问题.对于0到2n之间的任意一个偶数2m,构造了一个2n-正则简单图,使得其边连通度的值为2m.从而得到:2n-正则简单图的边连通度能够取{0,2,4,…,2n}中的任何一个偶数. 相似文献
9.
10.
一个图叫做1-正则的, 如果它的自同构群在它的弧集上作用正则. 设n是一个无平方因子的正整数. 证明了存在2n阶3度1-正则图当且仅当n=3tp1p2… ps≥13, 其中t≤1, s≥1, pi (1≤ i≤s)为互不相同的素数且满足3|(pi-1). 进一步, 对每个满足上述条件的整数n, 共有2s8722;1个互不同构的2n阶3度1-正则图, 并且这些图均为2n阶二面体群上的Cayley图. 由此可知, 不存在4m阶3度1-正则图, 其中m为无平方因子的奇数. 相似文献
11.
12.
A dominating setD of a graph G is a subset of V(G) such that for every vertex v∈V(G), either v∈D or there exists a vertex u∈D that is adjacent to v in G. Dominating sets of small cardinality are of interest. A connected dominating setC of a graph G is a dominating set of G such that the subgraph induced by the vertices of C in G is connected. A weakly-connected dominating setW of a graph G is a dominating set of G such that the subgraph consisting of V(G) and all edges incident with vertices in W is connected. In this paper we present several algorithms for finding small connected dominating sets and small weakly-connected dominating sets of regular graphs. We analyse the average-case performance of these heuristics on random regular graphs using differential equations, thus giving upper bounds on the size of a smallest connected dominating set and the size of a smallest weakly-connected dominating set of random regular graphs. 相似文献
13.
We associate a graph 𝒩 G with a group G (called the non-nilpotent graph of G) as follows: take G as the vertex set and two vertices are adjacent if they generate a non-nilpotent subgroup. In this article, we study the graph theoretical properties of 𝒩 G and its induced subgraph on G \ nil(G), where nil(G) = {x ∈ G | ? x, y ? is nilpotent for all y ∈ G}. For any finite group G, we prove that 𝒩 G has either |Z*(G)| or |Z*(G)| +1 connected components, where Z*(G) is the hypercenter of G. We give a new characterization for finite nilpotent groups in terms of the non-nilpotent graph. In fact, we prove that a finite group G is nilpotent if and only if the set of vertex degrees of 𝒩 G has at most two elements. 相似文献
14.
A. B. Raha 《Proceedings Mathematical Sciences》1992,102(1):49-51
A simpler example of regular space that is not completely regular is attempted. 相似文献
15.
《Journal of Pure and Applied Algebra》2023,227(2):107178
We calculate explicitly cohomologies of the lattices over the Kleinian 4-group belonging to the regular components of the Auslander–Reiten quiver as well as of their dual modules. We also give a canonical form of cohomology classes under the action of automorphisms. The result is applied to the classification of some crystallographic and Chernikov groups. 相似文献
16.
17.
叶宏博证明了当Δ≥5时没有度序列是2rΔ2r的Δ-临界图.Kayathri推广了上述结果,证明了当Δ≥5时,没有同时满足下列两个条件的Δ-临界图:(a)G有一个2度点x;设y,z是x的两个邻接点;(b)有一主项点y1∈NG(y)(y1≠y)与-2度点邻接.我们对上述结果进一步推广,证明了条件(b)不是必要的;只要y1与一个度数小于Δ-1的点邻接即可(可以不是2度点). 相似文献
18.
19.
设k是一个正整数,G是一个顶点数为|G|=4k的图. 假设σ\-2(G)≥4k-1, 则G有一个支撑子图含k-1个4圈和一条顶点数为4的路,使得所有这些圈和路都是相互独立的. 设G=(V\-1,V \-2;E)是一个二分图使得|V\-1|=|V\-2|=2k. 如果对G中每一对满足x∈V\-1和y∈V\-2的不 相邻的顶点x和y 都有d(x)+d(y)≥2k+1, 则G包含k-1个相互独立的4圈和一条顶点数为4的路,使得所有这些圈和路都是相互独立的,并且此度条件是最好的. 相似文献
20.