Answers are grounded in this paper and cite their sources.
Let G G be a graph. Then, the inverse graph G − 1 {G}⁻¹ of G G is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of G G , where the similarity matrix is ± 1 ± 1 diagonal matrix. In this article, we introduced a generalization of this definition that serves the mixed graphs where the definition applied for the α α -Hermitian adjacency matrices of mixed graphs. Furthermore, for a class of unicyclic graphs, we were able to find an inverse mixed graph for a graph G G , where it was proven that G − 1 {G}⁻¹ does not exist.
No takes yet. Share an insight, caveat, or question.
Boulahmar et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: