Abstract
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
| Original language | English |
|---|---|
| Pages (from-to) | 57-73 |
| Number of pages | 17 |
| Journal | Communications in Combinatorics and Optimization |
| Volume | 1 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 06-2016 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Control and Optimization
Fingerprint
Dive into the research topics of 'More skew-equienergetic digraphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver