Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/701
Title: | On a class of strongly regular signed graphs | Authors: | Koledin, Tamara Stanić, Zoran |
Affiliations: | Numerical Mathematics and Optimization | Keywords: | Adjacency matrix;Complete signed graph;Eigenvalues;Inhomogeneous strongly regular signed graph;Net-degree | Issue Date: | 1-Jan-2020 | Journal: | Publicationes Mathematicae | Abstract: | Let w2(i; j) denote the difference between the numbers of positive and negative walks of length 2 starting at vertex i and terminating at j of a signed graph G. Signed graph G which is neither homogeneous complete nor totally disconnected is called strongly regular if there exist constants a; b; c such that w2(i, j) = a for i ~j, w2(i,j) = b for i ~j and w2(i,j) = c for i ~j, respectively. In this paper we consider the class of inhomogeneous strongly regular signed graphs satisfying a = -b, which are either complete or incomplete with c = a+b/2. It occurs that such strongly regular signed graphs have some properties that are analogous to those of strongly regular unsigned graphs. For example, contrary to some other strongly regular signed graphs, they have exactly 3 eigenvalues and their net-degree appears as a simple one. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/701 | ISSN: | 00333883 | DOI: | 10.5486/PMD.2020.8760 |
Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
6
checked on Nov 8, 2024
Page view(s)
20
checked on Nov 15, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.