Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0919.05043
Sciriha, Irene; Gutman, Ivan
Nut graphs: Maximally extending cores. (English)
[J] Util. Math. 54, 257-272 (1998). ISSN 0315-3681

A graph is a nut graph if its adjacency matrix has nullity one and all the components of a non-zero eigenvector corresponding to the eigenvalue zero are non-zero. Nut graphs are shown to be connected and non-bipartite and to exist for any order greater than or equal to seven. From the main result, namely that a nut graph has a deck of non-singular vertex deleted subgraphs, more structural features are deduced.
[Brigitte Servatius (Worcester)]

MSC 2000:: *05C50 Graphs and matrices

Keywords: nut graph; singular graph; deck of spectra

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]