Reach Energy of Digraphs

V Mahalakshmi, B Vijaya Praba, K Palani

Abstract

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.

Keywords

Reachable, Reachability matrix, reach eigen values,reach spectrum, Reach energy

PDF

References

Adiga.C, Balakrishnan, R., & So, W. (2010). The skew energy of a digraph. Linear Algebra and its Applications, 432(7), 1825-1835.

Arumugam.S, Ramachandran.S, Invitation to Graph Theory, SciTech.

Bapat.R.B. B, Graphs and Matrices Hindustan Book Agency, (2011)

Gutman. I, The Energy of a Graph, Ber. Math – Statist. Sekt. For schungsz. Graz 103 (1978), 1-22.

Mehtab Khan, (2021). A new notion of energy of digraphs. Iranian Journal of Mathematical Chemistry, 12(2), 111-125.

Palani, K., & Kumari, M. L. (2022). Minimum hop dominating energy of a graph, Advan.Appl.Math.Sci. 21(3), 2022, pp. 1169-1179.

Palani, K., & LalithaKumari, M. (2021, March). Total Energy of a Graph. Proceedings of the Second International Conference on Applied Mathematics and Intellectual Property Rights (pp. 9-10).

Pena.I and Rada.J, Energy of Digraphs, Linear Multilinear Algebra 56(5) (2008) 565-579.

DOI: http://dx.doi.org/10.23755/rm.v44i0.926

Refbacks

• There are currently no refbacks.

Copyright (c) 2022 V Mahalakshmi, B Vijaya Praba, K Palani