Sökning: onr:"swepub:oai:DiVA.org:mdh-60022" >
Chromatic number an...
Chromatic number and clique number of subgraphs of regular graph of matrix algebras
-
- Akbari, Saieed (författare)
- Sharif Univ Technol, Dept Math Sci, Tehran, Iran
-
- Aryapoor, Masood, 1977- (författare)
- Inst Res Fundamental Sci IPM, Sch Math, Tehran, Iran,MAM
-
- Jamaali, M. (författare)
- Sharif Univ Technol, Dept Math Sci, Tehran, Iran
-
(creator_code:org_t)
- Elsevier BV, 2012
- 2012
- Engelska.
-
Ingår i: Linear Algebra and its Applications. - : Elsevier BV. - 0024-3795 .- 1873-1856. ; 436:7, s. 2419-2424
- Relaterad länk:
-
https://doi.org/10.1...
-
visa fler...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Let R be a ring and X subset of R be a non-empty set. The regular graph of X, Gamma(X), is defined to be the graph with regular elements of X (non-zero divisors of X) as the set of vertices and two vertices are adjacent if their sum is a zero divisor. There is an interesting question posed in BCC22. For a field F, is the chromatic number of Gamma(GL(n)(F)) finite? In this paper, we show that if G is a soluble sub-group of GL(n)(F), then x (Gamma(G)) < infinity. Also, we show that for every field F, chi (Gamma(M-n(F))) = chi (Gamma(M-n(F(x)))), where x is an indeterminate. Finally, for every algebraically closed field F, we determine the maximum value of the clique number of Gamma(< A >), where < A > denotes the subgroup generated by A is an element of GL(n)(F). (C) 2011 Elsevier Inc. All rights reserved.
Ämnesord
- NATURVETENSKAP -- Matematik -- Algebra och logik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Algebra and Logic (hsv//eng)
Nyckelord
- Chromatic number
- Clique number
- Determinant
- Regular graph
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas