On the construction of graphs of nullity one
type: Item
instance of: scholarly article
title: On the construction of graphs of nullity one
zbMATH Open document ID: 0901.05069
DOI: 10.1016/S0012-365X(97)00036-8
author: Irene Sciriha
published in: Discrete Mathematics
publication date: 1998-04-01T00:00:00Z
review text: The author classifies the sets of \(k\) \((2\leq k\leq 5)\) linearly dependent rows of the adjacency matrix of a graph. Induced subgraphs related to these sets can be of some help in determining the multiplicity of the eigenvalue \(0\). Some constructions of graphs having eigenvalue \(0\) in the spectrum are given as well.
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 1135965
zbMATH Keywords: adjacency matrix
zbMATH Keywords: eigenvalue
reviewed by: Dragoš Cvetković
MaRDI profile type: Publication
cites work: Spektren endlicher Grafen
cites work: Q5678898
cites work: On the characteristic polynomial of homeomorphic images of a graph
cites work: Q4379759
cites work: Q4228232
description: scientific article; zbMATH DE number 1135965