Spectral Graph Theory

Aref Jeribi
Additional contact information
Aref Jeribi: University of Sfax, Department of Mathematics

Chapter Chapter 12 in Spectral Theory and Applications of Linear Operators and Block Operator Matrices, 2015, pp 413-439 from Springer

Abstract: Abstract The concept of the line graph of a given graph is so natural that it has been independently discovered by many authors. Of course, each author gave it a different name: It was called the interchange graph by Ore [272], derivative by H. Sachs [297], derived graph by L. W. Beineke [52], edge-to-vertex dual by M. Reed [291], coverning graph by G. Kirchhoff [189], and adjoint by V. Menon [247].

Keywords: Line Graph; Graphics Interchange; Low Local Complexity; Riesz-Markov Theorem; Essential Self-adjointness (search for similar items in EconPapers)
Date: 2015
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-3-319-17566-9_12

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

DOI: 10.1007/978-3-319-17566-9_12

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 ().