On the mixed adjacency matrix of a mixed graph
From MaRDI portal
Publication:5962846
DOI10.1016/J.LAA.2016.01.033zbMATH Open1331.05132OpenAlexW2289596728MaRDI QIDQ5962846FDOQ5962846
B. R. Rakshith, Chandrashekar Adiga, Wasin So
Publication date: 24 February 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.01.033
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Basic linear algebra (15A99) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- Graph Energy
- Title not available (Why is that?)
- Title not available (Why is that?)
- The skew energy of a digraph
- Title not available (Why is that?)
- Characteristic polynomials of skew-adjacency matrices of oriented graphs
- 3-regular digraphs with optimum skew energy
- Skew spectra of oriented bipartite graphs
- Title not available (Why is that?)
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Title not available (Why is that?)
Cited In (16)
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- Relations between the inertia indices of a mixed graph and those of its underlying graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Coopetition bunch graphs: competition and cooperation on COVID19 research
- Title not available (Why is that?)
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- Eigenvalues of Cayley graphs
- Incidence matrices and line graphs of mixed graphs
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- A mathematical approach on representation of competitions: competition cluster hypergraphs
- Some families of integral mixed graphs
- The relation between the H-rank of a mixed graph and the independence number of its underlying graph
- Title not available (Why is that?)
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- Hermitian adjacency matrix of the second kind for mixed graphs
This page was built for publication: On the mixed adjacency matrix of a mixed graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962846)