On the mixed adjacency matrix of a mixed graph

Adiga, Chandrashekar and Rakshith, B. R. and Wasin So, . (2016) On the mixed adjacency matrix of a mixed graph. Linear Algebra and its Applications, 495. 223 - 241.

Full text not available from this repository. (Request a copy)
Official URL: https://doi.org/10.1016/j.laa.2016.01.033

Abstract

A mixed graph is a graph with edges and arcs, which can be considered as a hybrid of an undirected graph and a directed graph. In this paper we define the mixed adjacency matrix and the mixed energy of a mixed graph. The mixed adjacency matrix generalizes both the adjacency matrix of an undirected graph and the skew-adjacency matrix of a digraph. Then we compute the characteristic polynomial of the mixed adjacency matrix of a mixed graph and deduce some basic results from it. Furthermore, we give bounds to the mixed energy of a general mixed graph, and we compute the mixed energy of some special mixed graphs. At the end of the paper, we introduce mixed unitary Cayley graphs and compute their spectra.

Item Type: Article
Uncontrolled Keywords: Mixed graph, Mixed adjacency matrix, Mixed energy
Subjects: E Mathematical Science > Mathematics
Divisions: Department of > Mathematics
Depositing User: Manjula P Library Assistant
Date Deposited: 07 Jun 2019 07:42
Last Modified: 08 Jul 2022 09:56
URI: http://eprints.uni-mysore.ac.in/id/eprint/2723

Actions (login required)

View Item View Item