Perturbations in a Signed Graph and its Index

In this paper we consider the behaviour of the largest eigenvalue (also called the index) of signed graphs under small perturbations like adding a vertex, adding an edge or changing the sign of an edge. We also give a partial ordering of signed cacti with common underlying graph by their indices and...

Full description

Bibliographic Details
Main Author: Stanić Zoran
Format: Article
Language:English
Published: University of Zielona Góra 2018-08-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.2035
_version_ 1797718049408679936
author Stanić Zoran
author_facet Stanić Zoran
author_sort Stanić Zoran
collection DOAJ
description In this paper we consider the behaviour of the largest eigenvalue (also called the index) of signed graphs under small perturbations like adding a vertex, adding an edge or changing the sign of an edge. We also give a partial ordering of signed cacti with common underlying graph by their indices and demonstrate a general method for obtaining lower and upper bounds for the index. Finally, we provide our computational results related to the generation of small signed graphs.
first_indexed 2024-03-12T08:45:19Z
format Article
id doaj.art-e5ec904f662046ed8108323c8a69fb53
institution Directory Open Access Journal
issn 2083-5892
language English
last_indexed 2024-03-12T08:45:19Z
publishDate 2018-08-01
publisher University of Zielona Góra
record_format Article
series Discussiones Mathematicae Graph Theory
spelling doaj.art-e5ec904f662046ed8108323c8a69fb532023-09-02T16:29:32ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922018-08-0138384185210.7151/dmgt.2035dmgt.2035Perturbations in a Signed Graph and its IndexStanić Zoran0Faculty of Mathematics, University of Belgrade, Studentski trg 16, 11 000Belgrade, SerbiaIn this paper we consider the behaviour of the largest eigenvalue (also called the index) of signed graphs under small perturbations like adding a vertex, adding an edge or changing the sign of an edge. We also give a partial ordering of signed cacti with common underlying graph by their indices and demonstrate a general method for obtaining lower and upper bounds for the index. Finally, we provide our computational results related to the generation of small signed graphs.https://doi.org/10.7151/dmgt.2035signed graphswitching equivalenceindexcomputer search05c5005c3065f15
spellingShingle Stanić Zoran
Perturbations in a Signed Graph and its Index
Discussiones Mathematicae Graph Theory
signed graph
switching equivalence
index
computer search
05c50
05c30
65f15
title Perturbations in a Signed Graph and its Index
title_full Perturbations in a Signed Graph and its Index
title_fullStr Perturbations in a Signed Graph and its Index
title_full_unstemmed Perturbations in a Signed Graph and its Index
title_short Perturbations in a Signed Graph and its Index
title_sort perturbations in a signed graph and its index
topic signed graph
switching equivalence
index
computer search
05c50
05c30
65f15
url https://doi.org/10.7151/dmgt.2035
work_keys_str_mv AT staniczoran perturbationsinasignedgraphanditsindex