Advanced search
Publication Cover
Linear and Multilinear Algebra Volume 70, 2022 - Issue 19
Submit an article Journal homepage
79
Views
1
CrossRef citations to date
0
Altmetric
Research Article

Triangle-free graphs with six non-zero eigenvalues

Fang DuanSchool of Mathematical Sciences, Xinjiang Normal University, Urumqi, Xinjiang, People's Republic of ChinaCorrespondence[email protected]
View further author information
&
Weijuan ZhangSchool of Mathematical Sciences, Xinjiang Normal University, Urumqi, Xinjiang, People's Republic of ChinaView further author information
Pages 4214-4227 | Received 23 Jul 2020, Accepted 11 Dec 2020, Published online: 17 Jan 2021

References

  • Cheng B, Liu B. On the nullity of graphs. Electron J Linear Algebra. 2007;16:60–67.
  • Sciriha I. On the rank of graphs. In: Combinatorics, graph theory, and algorithms, Vol. I, II (Kalamazoo, MI, 1996), Kalamazoo, MI: New Issues Press; 1999; p. 769–778.
  • Chang GJ, Huang LH, Yeh HG. A characterization of graphs with rank 4. Linear Algebra Appl. 2011;434:1793–1798.
  • Chang GJ, Huang LH, Yeh HG. A characterization of graphs with rank 5. Linear Algebra Appl. 2012;436:4241–4250.
  • Oboudi MR. Bipartite graphs with at most six non-zero eigenvalues. Ars Math Contemp. 2016;11:315–325.
  • Wang L, Fan Y, Wang Y. The triangle-free graphs with rank 6. J Math Res Appl. 2014;34:517–528.
  • Cvetković D, Doob M, Sachs H. Spectra of graphs: theory and application. New York: Academic Press; 1980.
  • Ma HC, Yang WH, Li SG. Positive and negative inertia index of a graph. Linear Algebra Appl. 2013;438:331–341.
  • Duan F, Huang QX, Huang XY. On graphs with exactly two positive eigenvalues. Ars Math Contemp. 2019;17:319–347.

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.