Öz
Let $G$ be a group and $X$ a subset of $G$. Then $\mathcal{C}(G, X)$ is a graph with vertex set $X$ in which two distinct elements $x$, $y\in X$ are joined by an edge if $xy=yx$. In this paper, we study the clique number, the domination number, the diameter, the planarity, the perfection and regularity of $\mathcal{C}(G, X)$ where $G=GL(n,q)$ and $X$ is the set of transvections.
Anahtar Kelimeler
commuting graph transvections clique domination perfection planarity
Kaynakça
- [1] P.J. Cameron and Q. Mary, Automorphisms of graphs, London E14Ns, U.K. Draft, 2001.
- [2] M. Chudnovsky, N. Robertson, P. Seymour and R. Thomas, The strong perfect graph theorem, Ann. of Math. (2), 164 (1), 51–229, 2006.
- [3] H. Poliatsek, Irreducible Groups Generated by Transvections over Finite Fields of Characteristic Two, J. Algebra, 39, 328–333, 1976.
- [4] J.J. Rotman, An Introduction to the Theory of groups, Springer-Verlag Newyork, Inc. 1995.
Öz
Kaynakça
- [1] P.J. Cameron and Q. Mary, Automorphisms of graphs, London E14Ns, U.K. Draft, 2001.
- [2] M. Chudnovsky, N. Robertson, P. Seymour and R. Thomas, The strong perfect graph theorem, Ann. of Math. (2), 164 (1), 51–229, 2006.
- [3] H. Poliatsek, Irreducible Groups Generated by Transvections over Finite Fields of Characteristic Two, J. Algebra, 39, 328–333, 1976.
- [4] J.J. Rotman, An Introduction to the Theory of groups, Springer-Verlag Newyork, Inc. 1995.
Ayrıntılar
| Birincil Dil | İngilizce |
|---|---|
| Konular | Matematik |
| Bölüm | Matematik |
| Yazarlar | |
| Yayımlanma Tarihi | 8 Aralık 2019 |
| Yayımlandığı Sayı | Yıl 2019 Cilt: 48 Sayı: 6 |