首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3篇
  数学   3篇
  2018年   1篇
  2016年   2篇
排序方式: 共有3条查询结果,搜索用时 62 毫秒
1
1.
Let G be a finite group. The intersection graph ΔG of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G, and two distinct vertices X and Y are adjacent if XY ≠ 1, where 1 denotes the trivial subgroup of order 1. A question was posed by Shen (2010) whether the diameters of intersection graphs of finite non-abelian simple groups have an upper bound. We answer the question and show that the diameters of intersection graphs of finite non-abelian simple groups have an upper bound 28. In particular, the intersection graph of a finite non-abelian simple group is connected.  相似文献
2.
This paper studies the rainbow connection number of the power graph \(\Gamma _G\) of a finite group G. We determine the rainbow connection number of \(\Gamma _G\) if G has maximal involutions or is nilpotent, and show that the rainbow connection number of \(\Gamma _G\) is at most three if G has no maximal involutions. The rainbow connection numbers of power graphs of some nonnilpotent groups are also given.  相似文献
3.
The power graph ΓG of a finite group G is the graph whose vertex set is G, two distinct elements being adjacent if one is a power of the other. In this paper, we give sharp lower and upper bounds for the independence number of ΓG and characterize the groups achieving the bounds. Moreover, we determine the independence number of ΓG if G is cyclic, dihedral or generalized quaternion. Finally, we classify all finite groups G whose power graphs have independence number 3 or n2, where n is the order of G.  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号