Back to Search
Start Over
ON RELATION BETWEEN SPECTRA OF GRAPHS AND THEIR DIGRAPH DECOMPOSITIONS.
- Source :
-
Publications de l'Institut Mathématique . 2009, Issue 99, p47-54. 8p. 2 Diagrams. - Publication Year :
- 2009
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *DIRECTED graphs
*MATRICES (Mathematics)
*GRAPH theory
*COMBINATORICS
*ALGEBRA
Subjects
Details
- Language :
- English
- ISSN :
- 03501302
- Issue :
- 99
- Database :
- Academic Search Index
- Journal :
- Publications de l'Institut Mathématique
- Publication Type :
- Academic Journal
- Accession number :
- 42525445
- Full Text :
- https://doi.org/10.2298/PIM0999047S