Algebraic Connectivity and Disjoint Vertex Subsets of Graphs

Yan Sun and Faxu Li

Mathematical Problems in Engineering, 2020, vol. 2020, 1-6

Abstract:

It is well known that the algebraic connectivity of a graph is the second small eigenvalue of its Laplacian matrix. In this paper, we mainly research the relationships between the algebraic connectivity and the disjoint vertex subsets of graphs, which are presented through some upper bounds on algebraic connectivity.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/5763218.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/5763218.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5763218

DOI: 10.1155/2020/5763218

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().