Component Intersection Graph of Finite Dimensional Vector Spaces

Mohit Kumar1
1Department of Mathematics, Institute of Applied Sciences and Humanities, GLA University Mathura, Uttar Pradesh 281406, India

Abstract

In this paper, we introduce a graph structure, called component intersection graph, on a finite dimensional vector space V. The connectivity, diameter, maximal independent sets, clique number, chromatic number of component intersection graph have been studied.

Keywords: Component intersection graph, Connected, Diameter, Girth

1. Introduction

Apart from its combinatorial motivation, graph theory can also identify various algebraic structures. The investigation of graphs associated to algebraic structures is very important and main task of studying graphs associated to algebraic structures is to characterize the algebraic structures with graph and vice versa. Many fundamental papers devoted to graphs assigned to a ring had been studied. Till date, a lot of researches, viz.[1, 2, 3, 4, 5, 6] have been performed on simple graph structures to commutative rings. Recently, some algebraic graphs associated to groups, modules and vector spaces have been studied by different mathematicians (see [2, 6, 7, 8, 9]).

For the last few decades several mathematicians studied such graphs on various algebraic structures. These interdisciplinary studies allow us to obtain characterizations and representations of special classes of algebraic structures in terms of graphs and vice versa. The first step in this direction was initiated by Bosak [10] in 1964. After that Csa´ka´ny and Polla´k [11] studied the graphs of subgroups of a finite group. Zelinka [12] continued the work on intersection graphs of the nontrivial subgroups of finite abelian groups.

In[5], Chakrabarty et. al introduced the intersection graph G(R) of a family of nontrivial left ideals of a ring R. Let L(R) denotes the set of all nontrivial (nonzero proper) left ideals of R. The intersection graph of L(R) is the undirected simple graph (without loops and multiple edges) whose vertices are in a one-to-one correspondence with all nontrivial left ideals of R and two distinct vertices are joined by an edge if and only if the corresponding left ideals of R have a nontrivial (nonzero)intersection.

Most properties of a vector space are connected to the behavior of its basis. Also, basis plays a crucial roles in the study of vector space constructions. Let B={v1,v2,,vn} be a basis of a n-dimensional vector space V over a field F. Then any vector vV can be expressed as a linear combination of the form v=i=1nαivi. We define skeleton of v with respect to B, as SB(v)={vi | αi0} and VB={vV | 0<|SB(v)|<n}, Sk={vV | k|SB(v)|n1}, [Sk]={uV | |SB(u)|=k}, [Svk]={uV | |SB(u)|=k and vSB(u)}.

Das [13] introduced and studied the nonzero component graph Γ(Vv) on a finite dimensional vector space V, which is a simple undirected graph with vertex set as nonzero vectors of V and any two distinct vertices x,y are adjacent if and only if there exists at least one vi along which both x and y have nonzero components. Later, on in [8] Das investigated another interesting graph known as non-zero component union graph Γ(VB), which is a simple undirected graph with vertex set as non-zero vectors of V and any two distinct vertices u,v are adjacent if and only if SB(u)SB(v)=B.

Motivated by the above work, we introduce a new graph structure IB(V) known as component intersection graph associated with the basis B of a finite dimensional vector space V. IB(V) is a graph with the set of vertices VB and any two distinct vertices u and v of IB(V) are adjacent if and only if SB(u)SB(v)=.

In Section 3, we investigate some basic properties of component intersection graph IB(V) and show that IB(V) is connected and diam(IB(V))=3. Also, we investigate the graph theoretic properties of IB(V) and algebraic properties of V. Furthermore, we establish the equivalence between vector space isomorphism and graph isomorphism. Apart from this, we also study some basic properties of IB(V), i.e., maximal clique, chromatic number of IB(V).

In Section 4, we evaluate the order of IB(V) and the degree of a vertex of IB(V), when the order of the base field F is finite i.e., F=Fq. Moreover, we show that IB(V) is Eulerian. Finally in Section 5, we discuss the area of further research for IB(V) , for example, the structure of automorphism group, domination number and independent sets of IB(V), when the base field F is finite.

2. Definition and Preliminaries

Throughout this paper, V denotes a finite dimensional vector space over a field F and Fq is a finite field of order q. Let G=(V(G),E(G)) be a Graph, where V(G) is the set of vertices and E(G) is the set of edges of G. We say that G is connected if there exists a path between any two distinct vertices of G. For vertices a and b of G, d(a,b) denotes the length of the shortest path from a to b. In particular, d(a,a)=0 and d(a,b)= if~there~is~no~such~path. The diameter of G, denoted by diam(G)=sup{d(a,b) | a,bV(G)}. A cycle in a graph G is a path that begins and ends at the same vertex. A cycle of length n is denoted by Cn. A graph is said to be Eulerian if it contains a cycle containing all the edges in G exactly once. The girth of G, denoted by gr(G), is the length of a shortest cycle in G,  (gr(G)= if G contains~no~cycle). Two graphs G1=(V(G1),E(G1)) and G2=(V(G2),E(G2)) are said to be isomorphic if there exists a bijection ϕ:V(G1)V(G2)) such that (u,v)E(G1) if and only if (ϕ(u),ϕ(v))E(G2). A complete graph G is a graph where all distinct vertices are adjacent. The complete graph with |V(G)|=n is denoted by Kn. A graph H=(V(H),E(H)) is said to be a subgraph of G, if V(H)V(G) and E(H)E(G). Moreover, H is said to be induced subgraph of G if V(H)V(G) and E(H)={(u,v)E(G) | u,vV(H)} and is denoted by G[V(H)]. Also G is called a null graph if E(G)=. For a graph G, a complete subgraph of G is called a clique. The clique number, ω(G), is the greatest integer n1 such that KnG, and ω(G)= if  KnG for all n1. The chromatic number χ(G) of a graph G is the minimum number of colours needed to colour all the vertices of G such that every two adjacent vertices get different colours. For a connected graph G, δ=min{deg(x) | xV(G)} and Δ=max{deg(x) | xV(G)}. A subset D of V(G) is said to be dominating set if each vertex in V(G)D is adjacent to at least one vertex in D. The dominating number γ(G) are the minimum size of a dominating set in G. Graph-theoretic terms are presented as they appeared in Diestel [14].

3. Component Intersection Graph on Vector Spaces and Its Basic Properties

In this section, we study some basic properties, like connectedness, diameter, completeness, clique number and chromatic number of IB(V).

Example 1. Let F2×F2 and F2×F2×F2 be the vector spaces over F2 and B1={α1,α2}, B2={β1,β2,β3} be the bases of F2×F2 and F2×F2×F2 respectively. Clearly, V(IB1(F2×F2))={α1,α2} and V(IB2(F2×F2×F2))={β1,β2,β3,β1+β2,β2+β3,β1+β3} respectively. The components intersection graphs IB1(F2×F2) and IB2(F2×F2×F2) are given by the following Figures 1 and 2.

Remark 1. In view of above example, it may be noticed that the vertex set of our proposed graph IB1(F2×F2) is different from the vertex set of Γ((F2×F2)α) and Γ(F2×F2)B1 introduced by Das [8, 13]. Also the vertex set of IB2(F2×F2×F2) is different from the vertex set of Γ((F2×F2×F2)α) and Γ(F2×F2×F2)B2. The vertices α1 and α2 are not adjacent in Γ(Vα), but are adjacent in IB1(F2×F2). Moreover, β1 and β2 are not adjacent in Γ(F2×F2×F2)B2 and Γ((F2×F2×F2)β), but are adjacent in IB2(F2×F2×F2).

Remark 2. Let B={γ1,γ2,,γn} be the basis of a vector space V such that n3. The vertex set of IB(V) is different from the vertex set of Γ(V)B and Γ(Vγ). Also γ1 and γ2 are not adjacent in Γ(Vγ) and Γ(V)B, but are adjacent in IB(V).

Theorem 1. Let V be a n-dimensional vector space over a field F. Then IB(V) is a complete bipartite graph if and only if n=2.

Proof. Suppose that dim(V)=2 and B={u,v} is a basis of V. Then V(IB(V)) can be partitioned into two sets Bu={αu | 0αF} and Bv={βv | 0βF} such that BuBv= and BuBv=V(IB(V)). If u1Bu and u2Bv, then u1u2 in IB(V) and any two vertices of Bu are not adjacent in IB(V). Similarly, any two vertices of Bv are not adjacent in IB(V). Hence IB(V) is complete bipartite.

Conversely, assume that IB(V) is complete bipartite and let dim(V)=k. If k>2, then there exists a basis B={v1,v2,,vk} of V such that S(vi)S(vj)= for ij and 1i,jk. Thus v1,v2,v3V(IB(V)) such that S(vi)S(vj)= for ij and 1i,j3 and v1v2v3v1 is a cycle of length three. Hence IB(V) is not complete bipartite. If k=2, then by direct part of this theorem, IB(V) is complete bipartite. This complete the proof. ◻

If V is a finite dimensional vector space over F, then it is easy to show that IB(V) is empty graph if and only if dim(V)=1. Apart from this, the following theorem holds trivially;

Theorem 2. IB(V) is complete if and only if dim(V)=2 and F=F2.

Now we facilities our discussion with the following lemma;

Lemma 1. Let V be a finite dimensional vector space such that dim(V)2. Then IB(V) is connected and diam(IB(V))3.

Proof. Let B be a basis of V and u,v be two distinct vertices of IB(V). We have the following cases;

  1. (i) If SB(u)SB(v)=, then uv is a path in IB(V) and d(u,v)=1.

  2. (ii) If SB(u)SB(v), then we arrive at the following two subcases :

  3. (a) If SB(u)SB(v) or SB(v)SB(u), then there exists wBSB(u)SB(v) such that SB(u)SB(w)= SB(v)SB(w)=. Thus uwv is a path in IB(V) and d(u,w)=2.

  4. (b) If SB(u)SB(v) or SB(v)SB(u), then there exists uiSB(u)SB(v) ujSB(v)SB(u) such that uiuj and SB(ui)SB(v)= SB(uj)SB(u)= SB(ui)SB(uj)=. Thus uuiujv is a path in IB(V) and d(u,v)=3. Therefore in all the cases, we find that IB(V) is connected and diam(IB(V))3. Hence proved.

 ◻

The following theorem gives a characterization of the diameter of IB(V);

Theorem 3. Let V be a n-dimensional vector spaces over F. Then diam(IB(V))={1,if~ n=2 and F=F2,2,if~ n=2 and FF2,3,if~ n3.

Proof. Suppose that B={v1,v2,,vn} is a basis of V. We have the following cases;

  1. (i) If n=2 and F=F2, then by Theorem 2, IB(V)=K2 and diam(IB(V))=1.

  2. (ii) If n=2 and FF2, then by Theorem 1, IB(V) is complete bipartite and diam(IB(V))=2.

  3. (iii) If n3, then w1=v1+v2+v3++vn1 and w2=v2+v3++vn V(IB(V)) such that w1w2. Note that SB(w1)SB(w2) and d(w1,w2)1. If d(w1,w2)=2, then there exists wV(IB(V))) such that SB(w1)SB(w) =SB(w)SB(w2)= and w1ww2 is a path in IB(V). This gives SB(w)=, a contradiction. Thus d(w1,w2)2 and v1 and vn are two distinct vertices of IB(V) such that SB(v1)SB(w2)= SB(vn)SB(w1)= SB(vn)SB(v1)=. Therefore w1unu1w2 is a path in IB(V) and d(w1,w2)=3. By Lemma 1, we know that diam(IB(V))3 and hence diam(IB(V))=3.

 ◻

The following theorem gives a characterization of the diameter of IB(V);

Theorem 4. Let V be a n-dimensional vector space over F. Then gr(IB(V))={,if~ n=2 and F=F2,4,if~ n=2 and FF2,3,if~ n3.

Proof. Suppose that B={v1,v2,,vn} is a basis of a n-dimensional vector space V over a field F. Now we have the following three cases;

  1. (i) If n=2 and F=F2, then by Theorem 2, IB(V)=K2 and gr(IB(V))=.

  2. (ii) If n=2 and FF2, then by Theorem 1, IB(V) is complete bipartite and IB(V) contain a cycle of length four and gr(IB(V))=4.

  3. (iii) If n3, then v1,v2,v3V(IB(V)) such that v1v2v3v1 forms a triangle in IB(V). Hence gr(IB(V))=4.

 ◻

Theorem 5. Let V be a vector space over a field F with dim(V)4. Then IB(V) is triangulated.

Proof. Let B={v1,v2,,vn} be a basis of V and wV(IB(V)). We have the following two cases;

  1. (i) If |SB(w)|=1, then there exist u,vV(IB(V))SB(w) such that SB(v)SB(u)= SB(u)SB(w)= SB(v)SB(w)=.

  2. (ii) If |SB(w)|=2, then there exist u1,u2V(IB(V))SB(w) such that SB(v1)SB(u1)= SB(v1)SB(w)= SB(u1)SB(w)=. Thus u1wv1u1 forms a triangle in IB(V). Thus in all the cases, w is a vertex of some triangle and hence IB(V) is triangulated.

 ◻

Theorem 6. Let V be a finite dimensional vector space. Then dim(V)=n if and only if ω(IB(V))=n.

Proof. Suppose that B={v1,v2,,vn} is a basis of V. Note that BV(IB(V)) is a clique in IB(V). If possible, suppose B{w} is a clique of IB(V), where wV(IB(V)). Then SB(vi)SB(w)= for all i=1,2,,n and SB(w)=, a contradiction. Finally, we prove that there does not exist any clique of size n+1. If {w1,w2,,wn+1} is a clique of size n+1, then SB(wi)SB(wj)= for all ij and 1i,jn+1, |i=1n+1SB(wi)|>|B|, a contradiction. Therefore the clique number ω(IB(V)) of IB(V) is n.

Conversely, assume that ω(IB(V))=n and dimension of V is m. Then by direct part of this theorem, ω(IB(V))=m. Therefore m=n. ◻

Corollary 1. Let V1 and V2 be two finite dimensional vector spaces over the field F. Then V1 and V2 are isomorphic (as vector spaces) if and only if IB1(V1) and IB2(V2) are isomorphic (as graphs).

Proof. It is obvious that if V1 and V2 are isomorphic (as vector spaces), then IB1(V1) and IB2(V2) are isomorphic (as graphs).

Conversely, assume that IB1(V1) and IB2(V2) are isomorphic (as graphs) and dim(V1), dim(V2) are m, n respectively. Then by Theorem 6, the clique number ω(IB1(V1)) and ω(IB2(V2)) are n1 and m1 respectively. However, as the two graphs are isomorphic, m=n. Thus V1 and V2 are finite dimensional over the field F with m=n and hence both are isomorphic (as vector spaces). ◻

Corollary 2. Let V be a vector space over a field F and IB1(V), IB2(V) be the graphs associated with V with respect to the bases B1={u1,u2,,un} and B2={v1,v2,,vn} of V respectively. Then IB1(V) and IB2(V) are graph isomorphic.

Remark 3. The above corollary shows that the graph theoretic properties of IB(V) does not depend on the choice of the basis B.

Theorem 7. Let V be a n-dimensional vector space. Then the following statements hold;

  1. (i) There exists a graph homomorphism from IB(V) to IB(V)[B].

  2. (ii) If n=2k+1, i.e., n is odd, then Sk+1 is a maximal independent set in IB(V).

  3. (iii) If n=2k, i.e., n is even, then Sk+1[Svik] is a maximal independent set in IB(V).

Proof. Suppose that B={u1,u2,,un} is a basis of V.

  1. (i) Note that by Theorem 6, IB(V)[B] is a clique, i.e., a complete graph and every vertex v of IB(V) such that SB(v) contains at least one ( possible more than one ) member of B. Therefore there exists a map f:V(IB(V))B given by uu1, where uV(IB(V)) and u1B such that SB(u1)SB(u). By the axioms of choice the existence of such type of map is guaranteed. If wu in IB(V), i.e., SB(v)SB(w)=, then SB(v1)SB(w1)=. Thus v1w1 and since IB(V)[S1] is a complete graph, u1w1. Therefore f is an adjacency preserving map and a graph homomorphism.

  2. (ii) Note that if u,wSk+1, then |SB(u)SB(w)|1. Therefore Sk+1 is an independent set. For maximality, if u1V(IB(V))Sk+1 with |SB(u1)k, then there exists w1Sk+1 such that SB(u1)SB(w1)=. Hence Sk+1 is a maximal independent set in IB(V).

  3. (iii) Note that if u,wSk+1 IB(V)[Svik], then |SB(u1) SB(w1)|1. Therefore, Sk+1[Svik] is an independent set. For maximality, let u1V(IB(V))(Mk+1 [Mvik]). If |SB(u1)|k, then there exists w1[Svik] such that SB(u1)SB(w1)=. Hence Sk+1[Svik] is a maximal independent set in IB(V).

 ◻

Theorem 8. If V be a n-dimensional vector space, then λ(IB(V))=n.

Proof. Let B={v1,v2,,vn} be a basis of V. Since the clique number ω(IB(V)) of IB(V) is n, λ(IB(V))n. By Theorem 7 (i), λ(IB(V))|B|. Moreover, since B is a maximal clique, ω(IB(V))|B|. Since ω(IB(V))λ(IB(V)), we have the following inequality. ω(IB(V))λ(IB(V))|B|ω(IB(V)), and hence the theorem follows. ◻

Lemma 2. If V is a n-dimensional vector space, then |Sn1|n.

Proof. Suppose that B={v1,v2,,vn} is a basis of a n-dimensional vector space V. Clearly, ui=v1+v2++vi1 +vi+1++,vn, for 1in are distinct n member of Sn1. Hence proved. ◻

Lemma 3. If V is a n-dimensional vector space and D is a dominating set in IB(V), then |D|n.

Proof. Suppose that D is a dominating set of IB(V). We know that by Lemma 2, |Sn1|n. If Sn1D, then |D|n and we are done. Otherwise, there exist ui1Sn1D and w1DS1 such that ui1w1. Clearly, |SB(w1)|=1. Without loss of generality, we assume that u11=v2+v3++vn. Therefore uj2=v2+v3++vj1+w1+vj+1 +vn, 2jn are distinct (n2) member of Sn1 and uj2w1. If uj2D for all 2jn, then |D|n and we are done. Otherwise, there exists uj2D. Without loss of generality we assume that u22D. Since u22D and u22w1, there exists w2S1D such that u22w2. Clearly, |SB(w2)|=1 and u22=w1+v3++vn. Therefore uk3=w1+v3++vk1+w2+vk+1 +vn, 3kn are distinct (n3) member of Sn1 and uk3w1,uk3w2. If uk3D for all 3kn, then |D|n and we are done. Otherwise, there exists uk3D. Without loss of generality we assume that u33D. Since u33D and u33w1,u33w2, there exists w3S1D such that w3u33. Clearly, |SBw3)|=1 and u33=w1+w2+v4++vn. Therefore ul4=w1+w2+v4++vl1 +w3+vl+1+vn, 4ln are distinct (n4) member of Sn1 and ul4w1, ul4w2. ul4w3. If uk4D for all 4kn, then |D|n and we are done. Otherwise, there exists uk4D. Without loss of generality we assume that u44D. Since u44D and u44w1,u44w2,u44w3, there exists w4S1D such that w4u44. Clearly, |SB(w4)|=1 and u44=w1+w2+w3+v5+vn. Continuing in the similar way, there exist at least n distinct members w1,w2,,wn in D and the lemma follows. ◻

Theorem 9. If V is a n-dimensional vector space over a field F, then γ(IB(V))=n.

Proof. Suppose that B={v1,v2,,vn} is a basis of V. Let u be an arbitrary vertex of IB(V). Now we show that either uB or uvj for some 1jn. Assume that uB and uvj for all 1jn. Then SB(u)SB(vj) for all 1jn and {v1,v2,,vn}SB(u), i.e., SB(u)=B, which is a contradiction. Thus either uB or uvj for some 1jn and B is a domination set for In(V). For minimal dominating set Bj=D{uj} and uj=v1+v2++vj1+vj+1++vnV(IB(V)) SB(uj)SB(vj) for all viBj, i.e., viuj for all viBj and viBj. Thus B is a minimum dominating set of IB(V) and by Lemma 3, we get the required result. ◻

4. Component Intersection Graph When the Base Field of a Finite Dimensional Vector Space is Finite

In this section, we study some basic properties of IB(V), when the order of the base field F is finite i.e., F=Fq. Moreover, we find order of IB(V) and degree of vertex of IB(V).

Theorem 10. Let V be a n-dimensional vector space over a field Fq. Then order of IB(V) is qn(q1)n1.

Proof. Suppose that B is a basis of n-dimensional vector space V over a field Fq. Note that V(IB(V))= BV={vV | 1|SB(v)|n1} and the number of ways choosing uV such that |SB(v)|=n is (q1)n. Therefore the order of IB(V) is qn(q1)n1. ◻

Theorem 11. Let V be a n-dimensional vector space over a field Fq. If v is a vertex in IB(V) such that |SB(v)|=k, then deg(v)=qnk1.

Proof. Let B={v1,v2,,vn} be a basis of n-dimensional vector space V over a field Fq and wV(IB(V)) such that |SB(w)|=k. For deg(w), we find the total number of vertices ui of IB(V) such that SB(w)SB(ui)=. For this without loss of generality, we may assume that SB(w)={v1,v2,,vk}=Bk. If uV(IB(V)) such that u=α1v1+α2v2++αnvn and uw, then SB(w)SB(u)=, i.e., αi=0 for all i=1,2,,k. Thus the set B of all uiV(IB(V)) such that ui=α1v1+α2v2++αnvn and αj=0 for 1jk and j0 for some k+1jn has |B|=qnk1 elements. Therefore the deg(w)=qnk1. ◻

Corollary 3. Let V be a n-dimensional vector space over a field Fq. Then the following statements hold:

  1. (i) δ=q1 and Δ=qn11.

  2. (ii) IB(V) is Eulerian if and only if q is even.

5. Conclusion

In this paper, we have introduced a component intersection graph IB(V) of a finite dimensional vector space V and investigated various inter-relationships between IB(V) (as a graph) and V (as a vector space). The main aim of this analysis is to study the basic properties of connectedness, diameter, clique, and chromatic number of IB(V). As an area of further research, one can look into the structure of automorphism group, independent number and genus of IB(V) in case of finite field.

Acknowledgements

The authors are indebted to the referee for his/her useful suggestions critical comments.

Conflict of Interest

The author declares no conflict of interests.

References:

  1. Akbari, S. and Mohammadian, A., 2004. On the zero-divisor graph of a commutative ring. Journal of Algebra, 274(2), pp.847-855.
  2. Akbari, S., Heydari, F. and Maghasedi, M., 2015. The intersection graph of a group. Journal of Algebra and its Applications, 14(05), p.1550065.
  3. Akbari, S., Nikandish, R. and Nikmehr, M.J., 2013. Some results on the intersection graphs of ideals of rings. Journal of Algebra and its Applications, 12(04), p.1250200.
  4. Badawi, A., 2014. On the annihilator graph of a commutative ring. Communications in Algebra, 42(1), pp.108-121.
  5. Chakrabartya, I., Ghosh, S., Mukherjee, T. K., and Sen, M. K., 2009. Intersection graph of ideals of commutative rings. Discrete Mathematics, 309(17), pp.5381-5392.
  6. Yaraneri, E., 2013. Intersection graph of a module. Journal of Algebra and its Applications, 12(05), p.1250218.
  7. Das, A., 2016. Subspace inclusion graph of a vector space. Communications in Algebra, 44(11), pp.4724-4731.
  8. Das, A., 2017. Non-zero component union graph of a finite-dimensional vector space. Linear and Multilinear Algebra, 65(6), pp.1276-1287.
  9. Das, A., 2017. On nonzero component graph of vector spaces over finite fields. Journal of Algebra and its Applications, 16(01), p.1750007.
  10. Bosak, J. (1964). The Graph of Semi Groups. In The theory of graphs and Application. New York: Academic Press.
  11. Csákány, B., and Pollák, G., 1969. The graphs of subgroups of a finite group. Czechoslovak Mathematical Journal, 19(94), pp.241-247.
  12. Zelinka, B., 1975. Intersection graphs of finite abelian groups. Czechoslovak Mathematical Journal, 25(2), pp.171-174.
  13. Das, A., 2016. Nonzero component graph of a finite dimensional vector space. Communications in Algebra, 44(9), pp.3918-3926.
  14. Diestel, R., 1997. Graph Theory. Springer-Verlag.