PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2004 | 24 | 2 | 213-221
Tytuł artykułu

Bounds for index of a modified graph

Autorzy
Treść / Zawartość
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
If a graph is connected then the largest eigenvalue (i.e., index) generally changes (decreases or increases) if some local modifications are performed. In this paper two types of modifications are considered:
(i) for a fixed vertex, t edges incident with it are deleted, while s new edges incident with it are inserted;
(ii) for two non-adjacent vertices, t edges incident with one vertex are deleted, while s new edges incident with the other vertex are inserted.
Within each case, we provide lower and upper bounds for the indices of the modified graphs, and then give some sufficient conditions for the index to decrease or increase when a graph is modified as above.
Słowa kluczowe
Twórcy
autor
  • Department of Mathematics, South China Normal University, Guangzhou 510631, P.R. China
Bibliografia
  • [1] D. Cvetković, P. Rowlinson and S. Simić, Eigenspaces of graphs (Cambridge University Press, Cambridge, 1997).
  • [2] C. Maas, Perturbation results for adjacency spectrum of a graph, Z. Angew. Math. Mech. 67 (1987) 428-430.
  • [3] P. Rowlinson, On angles and perturbations of graphs, Bull. London Math. Soc. 20 (1988) 193-197, doi: 10.1112/blms/20.3.193.
  • [4] P. Rowlinson, More on graph perturbations, Bull. London Math. Soc. 22 (1990) 209-216, doi: 10.1112/blms/22.3.209.
  • [5] W. Weinstein and W. Stenger, Methods of intermediate problems of eigenvalues (Academic Press, New York, 1972).
  • [6] B. Zhou, The changes in indices of modified graphs, Linear Algebra Appl. 356 (2002) 95-101, doi: 10.1016/S0024-3795(02)00321-X.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1226
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.