Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/697
Title: On Regular Signed Graphs with Three Eigenvalues
Authors: Andelić, Milica
Koledin, Tamara
Stanić, Zoran 
Affiliations: Numerical Mathematics and Optimization 
Keywords: Adjacency matrix;block design;eigenvalue;regular signed graph;signed line graph
Issue Date: 1-May-2020
Journal: Discussiones Mathematicae - Graph Theory
Abstract: 
In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establish certain basic results; for example, we show that they are walk-regular. We also give some constructions and determine all the signed graphs with 3 eigenvalues, under the constraint that they are either signed line graphs or have vertex degree 3. We also report our result of computer search on those with at most 10 vertices.
URI: https://research.matf.bg.ac.rs/handle/123456789/697
ISSN: 12343099
DOI: 10.7151/dmgt.2279
Appears in Collections:Research outputs

Show full item record

SCOPUSTM   
Citations

9
checked on Nov 15, 2024

Page view(s)

13
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.