Autor:	Tian-tian Zheng
Rok vydání:	2013
Předmět:	Combinatorics Mathematics::Combinatorics Mathematics::Rings and Algebras Bicyclic graphs Multiplicity (mathematics) Mathematics::Differential Geometry Adjacency matrix Undirected graph Eigenvalues and eigenvectors Graph Mathematics
Zdroj:	Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013 ISBN: 9783642375019 BIC-TA
DOI:	10.1007/978-3-642-37502-6_69
Popis:	Let \( G \) be a simple undirected graph on n vertices, \( A(G) \) be its adjacency matrix. The nullity \( \eta (G) \) of the graph \( G \) is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we characterize the bicyclic graphs with nullity \( n - 5 \).
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::7100cca9482f2081ca24b9bdee07f70f https://doi.org/10.1007/978-3-642-37502-6_69 Zobrazit plný text záznamu