Introduction

Xueliang Li, Yongtang Shi and Ivan Gutman
Additional contact information
Xueliang Li: Nankai University, Center for Combinatorics
Yongtang Shi: Nankai University, Center for Combinatorics
Ivan Gutman: University of Kragujevac, Faculty of Science

Chapter Chapter 1 in Graph Energy, 2012, pp 1-9 from Springer

Abstract: Abstract Let G be a finite and undirected simple graph, with vertex set V (G) and edge set E(G). The number of vertices of G is n, and its vertices are labeled by v 1,v 2,…,v n . The adjacency matrix A(G) of the graph G is a square matrix of order n, whose (i,j)-entry is equal to 1 if the vertices v i and v j are adjacent and is equal to zero otherwise. The characteristic polynomial of the adjacency matrix, i.e., det(x I n −A(G)), where I n is the unit matrix of order n, is said to be the characteristic polynomial of the graph G and will be denoted by ϕ(G,x). The eigenvalues of a graph G are defined as the eigenvalues of its adjacency matrix A(G), and so they are just the roots of the equation ϕ(G,x)=0. Since A(G) is symmetric, its eigenvalues are all real. Denote them by λ1,λ2,…,λ n , and as a whole, they are called the spectrum of G and denoted by Spec(G).

Keywords: Adjacency Matrix; Characteristic Polynomial; Complete Bipartite Graph; Hadamard Matrix; Pendent Vertex (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-1-4614-4220-2_1

Ordering information: This item can be ordered from
http://www.springer.com/9781461442202

DOI: 10.1007/978-1-4614-4220-2_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().