The Least Eigenvalue of Graphs

In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:数学研究及应用:英文版 2012, Vol.32 (6), p.659-665
1. Verfasser: Guidong YU Yizheng FAN Yi WANG
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 665
container_issue 6
container_start_page 659
container_title 数学研究及应用:英文版
container_volume 32
creator Guidong YU Yizheng FAN Yi WANG
description In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.
format Article
fullrecord <record><control><sourceid>chongqing</sourceid><recordid>TN_cdi_chongqing_primary_44263059</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>44263059</cqvip_id><sourcerecordid>44263059</sourcerecordid><originalsourceid>FETCH-chongqing_primary_442630593</originalsourceid><addsrcrecordid>eNpjYeA0MrA01TUyMzXkYOAtLs5MMjA0NDE1NDay4GSQC8lIVfBJTSwuUXDNTE_NK0vMKU1VyE9TcC9KLMgo5mFgTUvMKU7lhdLcDIpuriHOHrrJGfl56YWZeenxBUWZuYlFlfEmJkZmxgamlsbEqAEAtoEqzw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The Least Eigenvalue of Graphs</title><source>Alma/SFX Local Collection</source><creator>Guidong YU Yizheng FAN Yi WANG</creator><creatorcontrib>Guidong YU Yizheng FAN Yi WANG</creatorcontrib><description>In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.</description><identifier>ISSN: 2095-2651</identifier><language>eng</language><subject>下界 ; 最小特征值 ; 顺序图</subject><ispartof>数学研究及应用:英文版, 2012, Vol.32 (6), p.659-665</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/94404A/94404A.jpg</thumbnail><link.rule.ids>314,777,781,4010</link.rule.ids></links><search><creatorcontrib>Guidong YU Yizheng FAN Yi WANG</creatorcontrib><title>The Least Eigenvalue of Graphs</title><title>数学研究及应用:英文版</title><addtitle>Journal of Mathematical Research with Applications</addtitle><description>In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.</description><subject>下界</subject><subject>最小特征值</subject><subject>顺序图</subject><issn>2095-2651</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNpjYeA0MrA01TUyMzXkYOAtLs5MMjA0NDE1NDay4GSQC8lIVfBJTSwuUXDNTE_NK0vMKU1VyE9TcC9KLMgo5mFgTUvMKU7lhdLcDIpuriHOHrrJGfl56YWZeenxBUWZuYlFlfEmJkZmxgamlsbEqAEAtoEqzw</recordid><startdate>2012</startdate><enddate>2012</enddate><creator>Guidong YU Yizheng FAN Yi WANG</creator><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>~WA</scope></search><sort><creationdate>2012</creationdate><title>The Least Eigenvalue of Graphs</title><author>Guidong YU Yizheng FAN Yi WANG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-chongqing_primary_442630593</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>下界</topic><topic>最小特征值</topic><topic>顺序图</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Guidong YU Yizheng FAN Yi WANG</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库- 镜像站点</collection><jtitle>数学研究及应用:英文版</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Guidong YU Yizheng FAN Yi WANG</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Least Eigenvalue of Graphs</atitle><jtitle>数学研究及应用:英文版</jtitle><addtitle>Journal of Mathematical Research with Applications</addtitle><date>2012</date><risdate>2012</risdate><volume>32</volume><issue>6</issue><spage>659</spage><epage>665</epage><pages>659-665</pages><issn>2095-2651</issn><abstract>In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.</abstract></addata></record>
fulltext fulltext
identifier ISSN: 2095-2651
ispartof 数学研究及应用:英文版, 2012, Vol.32 (6), p.659-665
issn 2095-2651
language eng
recordid cdi_chongqing_primary_44263059
source Alma/SFX Local Collection
subjects 下界
最小特征值
顺序图
title The Least Eigenvalue of Graphs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T13%3A53%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-chongqing&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Least%20Eigenvalue%20of%20Graphs&rft.jtitle=%E6%95%B0%E5%AD%A6%E7%A0%94%E7%A9%B6%E5%8F%8A%E5%BA%94%E7%94%A8%EF%BC%9A%E8%8B%B1%E6%96%87%E7%89%88&rft.au=Guidong%20YU%20Yizheng%20FAN%20Yi%20WANG&rft.date=2012&rft.volume=32&rft.issue=6&rft.spage=659&rft.epage=665&rft.pages=659-665&rft.issn=2095-2651&rft_id=info:doi/&rft_dat=%3Cchongqing%3E44263059%3C/chongqing%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_cqvip_id=44263059&rfr_iscdi=true