ON RELATION BETWEEN SPECTRA OF GRAPHS AND THEIR DIGRAPH DECOMPOSITIONS

被引：1
|
作者：
Stevanovic, Dragan [1 ,2 ]
Stevanovic, Sanja [3 ]
机构：
[1] Univ Nis PMF, Nish, Serbia
[2] Univ Primorska FAMNIT, Koper, Slovenia
[3] Univ Nis, Fac Civil Engn & Architecture, Nish, Serbia
来源：
PUBLICATIONS DE L INSTITUT MATHEMATIQUE-BEOGRAD | 2009年 / 85卷 / 99期
关键词：
Adjacency matrix; Digraph; Decomposition; Eigenvalues;
D O I：
10.2298/PIM0999047S
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A graph, consisting of undirected edges, can be represented as a sum of two digraphs, consisting of oppositely oriented directed edges. Gutman and Plath in [J. Serb. Chem. Soc. 66 (2001), 237-241] showed that for annulenes, the eigenvalue spectrum of the graph is equal to the sum of the eigenvalue spectra of respective two digraphs. Here we exhibit a number of other graphs with this property.
引用
收藏
页码：47 / 54
页数：8
相关论文
共 50 条
  • [1] On the Aα--spectra of graphs and the relation between Aα- and Aα--spectra
    Fakieh, Wafaa
    Alkhamisi, Zakeiah
    Alashwali, Hanaa
    AIMS MATHEMATICS, 2024, 9 (02): : 4587 - 4603
  • [2] Digraph decompositions and monotonicity in digraph searching
    Kreutzer, Stephan
    Ordyniak, Sebastian
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (35) : 4688 - 4703
  • [3] Digraph Decompositions and Monotonicity in Digraph Searching
    Kreutzer, Stephan
    Ordyniak, Sebastian
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2008, 5344 : 336 - 347
  • [4] DIGRAPH DECOMPOSITIONS AND EULERIAN SYSTEMS
    BOUCHET, A
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (03): : 323 - 337
  • [5] MULTIFRACTAL DECOMPOSITIONS OF DIGRAPH RECURSIVE FRACTALS
    EDGAR, GA
    MAULDIN, RD
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 1992, 65 : 604 - 628
  • [6] Digraph measures: Kelly decompositions, games, and orderings
    Hunter, Paul
    Kreutzer, Stephan
    THEORETICAL COMPUTER SCIENCE, 2008, 399 (03) : 206 - 219
  • [7] Digraph Measures: Kelly Decompositions, Games, and Orderings
    Hunter, Paul
    Kreutzer, Stephan
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 637 - 644
  • [8] On the algorithmic effectiveness of digraph decompositions and complexity measures
    Lampis, Michael
    Kaouri, Georgia
    Mitsou, Valia
    DISCRETE OPTIMIZATION, 2011, 8 (01) : 129 - 138
  • [9] On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
    Lampis, Michael
    Kaouri, Georgia
    Mitsou, Valia
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 220 - +
  • [10] Spectra of digraph transformations
    Deng, Aiping
    Kelmans, Alexander
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 439 (01) : 106 - 132
12345