Extremal Singular Graphs

Irene Triantafillou ()
Additional contact information
Irene Triantafillou: University of Thessaly

A chapter in Discrete Mathematics and Applications, 2020, pp 487-499 from Springer

Abstract: Abstract A graph is called singular if its adjacency matrix is singular. The problem of characterizing all singular graphs was posed in 1957 by L. Collatz and U. Sinogowitz. Since then, it has been studied intensely due to its great importance in mathematics and in chemistry. However, the problem has proved to be rather complicated and has not yet been solved completely. In this paper, we emphasize on some of the most important results on graphs that are extremal with regard to their nullity/rank.

Date: 2020
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:spochp:978-3-030-55857-4_20

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

DOI: 10.1007/978-3-030-55857-4_20

Access Statistics for this chapter

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