505
Views
17
CrossRef citations to date
0
Altmetric
Articles

On subspace inclusion graph of a vector space

Pages 554-564 | Received 17 Oct 2016, Accepted 03 Mar 2017, Published online: 27 Mar 2017

References

  • Anderson DF, Livingston PS. The zero-divisor graph of a commutative ring. J Algebra. 1999;217:434–447.
  • Chakrabarty I, Ghosh S, Mukherjee TK, et al. Intersection graphs of ideals of rings. Disc Math. 2009;309(17):5381–5392.
  • Maimani HR, Pournaki MR, Tehranian A, et al. Graphs attached to rings revisited. Arab J Sci Eng. 2011;36:997–1011.
  • Das A. Non-zero component graph of a finite dimensional vector space. Commun Algebra. 2016;44(9):3918–3926.
  • Das A. Non-zero component union graph of a finite dimensional vector space. Linear Multilinear Algebra. 2017;65(6):1276–1287. DOI:10.1080/03081087.2016.1234577
  • Das A. Subspace inclusion graph of a vector space. Commun Algebra. 2016;44(11):4724–4731.
  • Das A. On non-zero component graph of vector spaces over finite fields. J Algebra Appl. 2017;16(1). DOI: 10.1142/S0219498817500074
  • Laison JD, Qing Y. Supspace intersection graphs. Disc Math. 2010;310:3413–3416.
  • West DB. Introduction to graph theory. Delhi: Prentice Hall; 2001.
  • Kac V, Cheung P. Quantum calculus. Springer: Universitext; 2001.
  • Chudnovsky M, Robertson N, Seymour P, et al. The strong perfect graph theorem. Ann Math. 2006;164:51–229.
  • Godsil C, Royle G. Algebraic graph theory, Graduate text in mathematics. Vol. 207. New York: Springer; 2001.
  • Volkmann L. A characterization of bipartite graphs with independence number half their order. Aust J Combin. 2008;41:219–222.
  • Alspach B. Hamiltonian cycles in vertex-transitive graphs of order 2p. Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic University, Boca Raton (FL), 1979); 1979. p. 131–139. Congress Numer XXIII-XX, Utilitas Math.
  • Goldman J, Rota GC. The number of subspaces of a vector space. Recent progress in combinatorics (Proceedings of the Third Waterloo Conference on Combinatorics, 1968), New York (NY):Academic Press; 1969. p. 75–83.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.