Skip to main content
SpringerLink
Log in

Graphs with a Small Number of Nonnegative Eigenvalues

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

In this paper, by means of computer checking, all simple graphs with at most two nonnegative eigenvalues, and all minimal simple graphs with exactly two (respectively, three) nonnegative eigenvalues are determined.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Faculty of Science, University of Kragujevac, Radoja Domanovica 12, 34000 Kragujevac, Yugoslavia, , , , , , YU

    Miroslav Petrović

Authors
  1. Miroslav Petrović
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: April 5, 1996 / Revised: May 2, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Petrović, M. Graphs with a Small Number of Nonnegative Eigenvalues. Graphs Comb 15, 221–232 (1999). https://doi.org/10.1007/s003730050042

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730050042

Keywords

Search

Navigation