Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/720
Title: Integral regular net-balanced signed graphs with vertex degree at most four
Authors: Stanić, Zoran 
Affiliations: Numerical Mathematics and Optimization 
Keywords: Adjacency matrix;Net-balanced signed graph;Signed graph;Switching equivalent signed graphs
Issue Date: 1-Jan-2019
Journal: Ars Mathematica Contemporanea
Abstract: 
A signed graph is called integral if its spectrum consists entirely of integers, it is r-regular if its underlying graph is regular of degree r, and it is net-balanced if the difference between positive and negative vertex degree is a constant on the vertex set (this constant is called the net-balance and denoted %). We determine all the connected integral 3-regular net-balanced signed graphs. In the next natural step, for r = 4, we consider only those whose net-balance is a simple eigenvalue. There, we complete the list of feasible spectra in bipartite case for % 6= 0 and prove the non-existence for % = 0. Certain existence conditions are established and the existence of some 4-regular (simple) graphs is confirmed. In this study we transferred some results from the theory of graph spectra; in particular, we give a counterpart to the Hoffman polynomial.
URI: https://research.matf.bg.ac.rs/handle/123456789/720
ISSN: 18553966
DOI: 10.26493/1855-3974.1740.803
Appears in Collections:Research outputs

Show full item record

SCOPUSTM   
Citations

27
checked on Nov 8, 2024

Page view(s)

24
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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