scholarly journals On nonzero component graph of vector spaces over finite fields

2017 ◽  
Vol 16 (01) ◽  
pp. 1750007 ◽  
Author(s):  
Angsuman Das

In this paper, we study nonzero component graph [Formula: see text] of a finite-dimensional vector space [Formula: see text] over a finite field [Formula: see text]. We show that the graph is Hamiltonian and not Eulerian. We also characterize the maximal cliques in [Formula: see text] and show that there exists two classes of maximal cliques in [Formula: see text]. We also find the exact clique number of [Formula: see text] for some particular cases. Moreover, we provide some results on size, edge-connectivity and chromatic number of [Formula: see text].


2019 ◽  
Vol 19 (05) ◽  
pp. 2050086 ◽  
Author(s):  
T. Tamizh Chelvam ◽  
K. Prabha Ananthi

Let [Formula: see text] be a k-dimensional vector space over a finite field [Formula: see text] with a basis [Formula: see text]. The nonzero component graph of [Formula: see text], denoted by [Formula: see text], is a simple undirected graph with vertex set as nonzero vectors of [Formula: see text] such that there is an edge between two distinct vertices [Formula: see text] if and only if there exists at least one [Formula: see text] along which both [Formula: see text] and [Formula: see text] have nonzero scalars. In this paper, we find the vertex connectivity and girth of [Formula: see text]. We also characterize all vector spaces [Formula: see text] for which [Formula: see text] has genus either 0 or 1 or 2.



2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Le Anh Vinh

International audience We show that if the cardinality of a subset of the $(2k-1)$-dimensional vector space over a finite field with $q$ elements is $\gg q^{2k-1-\frac{1}{ 2k}}$, then it contains a positive proportional of all $k$-simplexes up to congruence. Nous montrons que si la cardinalité d'un sous-ensemble de l'espace vectoriel à $(2k-1)$ dimensions sur un corps fini à $q$ éléments est $\gg q^{2k-1-\frac{1}{ 2k}}$, alors il contient une proportion non-nulle de tous les $k$-simplexes de congruence.



1985 ◽  
Vol 98 ◽  
pp. 139-156 ◽  
Author(s):  
Yasuo Teranishi

Let G be a connected linear algebraic group, p a rational representation of G on a finite-dimensional vector space V, all defined over C.



1985 ◽  
Vol 100 (1-2) ◽  
pp. 123-138 ◽  
Author(s):  
M. A. Reynolds ◽  
R. P. Sullivan

SynopsisIn 1966, J. M. Howie characterised the transformations of an arbitrary set that can be written as a product (under composition) of idempotent transformations of the same set. In 1967, J. A. Erdos considered the analogous problem for linear transformations of a finite-dimensional vector space and in 1983, R. J. Dawlings investigated the corresponding idea for bounded operators on a separable Hilbert space. In this paper we study the case of arbitrary vector spaces.



10.37236/907 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Le Anh Vinh

Iosevich and Senger (2008) showed that if a subset of the $d$-dimensional vector space over a finite field is large enough, then it contains many $k$-tuples of mutually orthogonal vectors. In this note, we provide a graph theoretic proof of this result.



2016 ◽  
Vol 16 (09) ◽  
pp. 1750173 ◽  
Author(s):  
R. Nikandish ◽  
H. R. Maimani ◽  
A. Khaksari

A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let [Formula: see text] be a vector space over a field [Formula: see text] with [Formula: see text] as a basis and [Formula: see text] as the null vector. The non-zero component graph of [Formula: see text] with respect to [Formula: see text], denoted by [Formula: see text], is a graph with the vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if there exists at least one [Formula: see text] along which both [Formula: see text] and [Formula: see text] have non-zero components. In this paper, it is shown that [Formula: see text] is a weakly perfect graph. Also, we give an explicit formula for the vertex chromatic number of [Formula: see text]. Furthermore, it is proved that the edge chromatic number of [Formula: see text] is equal to the maximum degree of [Formula: see text].



1993 ◽  
Vol 114 (2) ◽  
pp. 303-319 ◽  
Author(s):  
John Fountain ◽  
Andrew Lewin

AbstractIn 1966, J. M. Howie characterized the self-maps of a set which can be written as a product (under composition) of idempotent self-maps of the same set. In 1967, J. A. Erdos considered the analogous question for linear maps of a finite dimensional vector space and in 1985, Reynolds and Sullivan solved the problem for linear maps of an infinite dimensional vector space. Using the concept of independence algebra, the authors gave a common generalization of the results of Howie and Erdos for the cases of finite sets and finite dimensional vector spaces. In the present paper we introduce strong independence algebras and provide a common generalization of the results of Howie and Reynolds and Sullivan for the cases of infinite sets and infinite dimensional vector spaces.



1960 ◽  
Vol 3 (3) ◽  
pp. 293-295
Author(s):  
Jonathan Wild

Let E be a finite dimensional vector space over a finite field of characteristic p > 0; dim E = n. Let (x,y) be a symmetric bilinear form in E. The radical Eo of this form is the subspace consisting of all the vectors x which satisfy (x,y) = 0 for every y ϵ E. The rank r of our form is the codimension of the radical.



1985 ◽  
Vol 99 ◽  
pp. 131-146 ◽  
Author(s):  
Yasuo Teranishi

Let (G, ρ, V) be a triple of a linear algebraic group G and a rational representation ρ on a finite dimensional vector space V, all defined over the complex number field C.



Sign in / Sign up

Export Citation Format

Share Document