journal article
oaidoi:10.1016/j.laa.2010.04.009

The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph

Authors
Publication date
1 October 2010
Publisher
Elsevier Inc.
Doi

    Abstract

    AbstractIn this paper we characterize the unique graph whose least eigenvalue attains the minimum among all graphs of a fixed order and a given vertex (edge) independence number or vertex (edge) cover number, and get some bounds for the vertex (edge) independence number, vertex (edge) cover number of a graph in terms of the least eigenvalue of the graph

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/j.laa.2010.04.009
    Last time updated on 05/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.