Graphs Having Most of Their Eigenvalues Shared by a Vertex Deleted Subgraph

Graphs Having Most of Their Eigenvalues Shared by a Vertex Deleted Subgraph

Let <i>G</i> be a simple graph and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo>...

Full description

Bibliographic Details
Main Author: Alexander Farrugia
Format: Article
Language:English
Published: MDPI AG 2021-09-01
Series:Symmetry
Subjects:
polynomial reconstruction problem
graph walk
eigenvalue
characteristic polynomial
vertex deleted subgraph
disconnected graph
Online Access:https://www.mdpi.com/2073-8994/13/9/1663

Internet

https://www.mdpi.com/2073-8994/13/9/1663

Similar Items