Reach Energy of Digraphs
| Autor: | V Mahalakshmi, B Vijaya Praba, K Palani |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Ratio Mathematica, Vol 44, Iss 0, Pp 363-370 (2022) |
| Druh dokumentu: | article |
| ISSN: | 1592-7415 2282-8214 |
| DOI: | 10.23755/rm.v44i0.926 |
| Popis: | A Digraph D consists of two finite sets ), where denotes the vertex set and denotes the arc set. For vertices if there exists a directed path from to then is said to be reachable from and vice versa. The Reachability matrix of D is the matrix , where if is reachable from and otherwise. The eigen values corresponding to the reachability matrix are called reach eigen values. The reach energy of a digraph is defined by where is the eigen value of the reachability matrix. In this paper we introduce the reach spectrum of a digraph and study its properties and bounds. Moreover, we compute reachspectrum for some digraphs. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|