Publication:2447959: Difference between revisions

From MaRDI portal
Publication:2447959
Created automatically from import240129110113
 
 
(No difference)

Latest revision as of 15:35, 2 May 2024

DOI10.1016/J.LAA.2014.02.016zbMath1286.05087arXiv1505.01321OpenAlexW1994037159MaRDI QIDQ2447959

Bojan Mohar, Krystal Guo

Publication date: 29 April 2014

Published in: Linear Algebra and its Applications, Journal of Graph Theory (Search for Journal in Brave)

Abstract: The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity $i$ (and its symmetric entry is $-i$) if the reverse arc $yx$ is not present. We also allow arcs in both directions and unoriented edges, in which case we use $1$ as the entry. This allows to use the definition also for mixed graphs. This matrix has many nice properties; it has real eigenvalues and the interlacing theorem holds for a digraph and its induced subdigraphs. Besides covering the basic properties, we discuss many differences from the properties of eigenvalues of undirected graphs and develop basic theory. The main novel results include the following. Several surprising facts are discovered about the spectral radius; some consequences of the interlacing property are obtained; operations that preserve the spectrum are discussed -- they give rise to an incredible number of cospectral digraphs; for every $0lealphalesqrt{3}$, all digraphs whose spectrum is contained in the interval $(-alpha,alpha)$ are determined.


Full work available at URL: https://arxiv.org/abs/1505.01321





Cites Work


Related Items (only showing first 100 items - show all)

Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transposeOn the spectrum of complex unit gain graphsInverse of Hermitian adjacency matrix of mixed bipartite graphs\( \gamma \)-inverse graph of some mixed graphsOn the characteristic polynomial and energy of Hermitian quasi-Laplacian matrix of mixed graphsIntegral mixed Cayley graphs over abelian groupsPrincipal Minors of Hermitian (Quasi-)Laplacian Matrix of Second Kind for Mixed GraphsUnit gain graphs with two distinct eigenvalues and systems of lines in complex spaceOn cospectral oriented graphs and cospectral signed graphsPretty good state transfer in discrete-time quantum walksHS-integral and Eisenstein integral mixed Cayley graphs over abelian groupsMixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)Bounds for the rank of a complex unit gain graph in terms of the independence numberInertia indices and eigenvalue inequalities for Hermitian matricesOn extremal spectral results of digraphs based on sum distanceDigraphs with Hermitian spectral radius below 2 and their cospectrality with pathsUniversality in perfect state transferThe rank of a complex unit gain graph in terms of the matching numberOn the relation between theH-rank of a mixed graph and the matching number of its underlying graphSome families of integral mixed graphsCharacterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectraSpectral determinations and eccentricity matrix of graphsUnnamed ItemThe spectra of random mixed graphsBounds for the matching number and cyclomatic number of a signed graph in terms of rankHermitian adjacency spectrum and switching equivalence of mixed graphs\(H\)-integral and Gaussian integral normal mixed Cayley graphsOn -gain graphs with few positive eigenvaluesThe non-negative spectrum of a digraphGap sets for the spectra of cubic graphsState transfer on integral mixed circulant graphsMixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\)Splitting fields of mixed Cayley graphs over abelian groupsQuantum state transfer on integral oriented circulant graphsOn bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graphZero-divisor graphs of rings and their Hermitian matricesSemi-restricted rock, paper, scissorsOn the \({A_{\!\mathbb{C}}}\)-rank of multidigraphsMore on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphsHermitian matrices of roots of unity and their characteristic polynomialsWhy and how to add direction to a quantum walkSpectral analysis of non-Hermitian matrices and directed graphsOn the multiplicities of digraph eigenvaluesCombinatorial necessary conditions for regular graphs to induce periodic quantum walksQuantum walks defined by digraphs and generalized Hermitian adjacency matricesOn integral mixed Cayley graphs over non-abelian finite groups admitting an abelian subgroup of index 2Incidence matrices and line graphs of mixed graphsOn the inertia index of a mixed graph in terms of the matching numberCharacterizing signed mixed graphs with small eigenvaluesRelations between the skew spectrum of an oriented graph and the spectrum of an associated signed graphOn graphs whose orientations are determined by their Hermitian spectraGeometric and spectral analysis on weighted digraphsNEPS of complex unit gain graphsOn symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphsSplitting fields of some matrices of normal (mixed) Cayley graphsTransport properties in directed quantum walks on the lineUnnamed ItemUnnamed ItemInterlacing families and the Hermitian spectral norm of digraphsHermitian normalized Laplacian matrix for directed networksMinors of Hermitian (quasi-) Laplacian matrix of a mixed graphGeneralized spectral characterization of mixed graphsOn the spectra of general random mixed graphsComplex unit gain graphs with exactly one positive eigenvalueOn mixed graphs whose Hermitian spectral radii are at most 2Bounds for the energy of a complex unit gain graphProjecting signed two-mode networksRelation between the \(H\)-rank of a mixed graph and the rank of its underlying graphHermitian Laplacian matrix and positive of mixed graphsOn ABC Estrada index of graphsGain distance matrices for complex unit gain graphsHermitian-Randić matrix and Hermitian-Randić energy of mixed graphsMixed graphs with \(H\)-rank 3On the eigenvalues distribution in threshold graphsOn graphs whose least eigenvalue is greater than –2On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphsSome mixed graphs with \(H\)-rank 4, 6 or 8Mixed paths and cycles determined by their spectrumUnnamed ItemOn spectral properties of digraphs about maximum distanceThe index weighted Hermitian adjacency matrices for mixed graphsEigenvalues of complex unit gain graphs and gain regularityInverse of \(\alpha\)-Hermitian adjacency matrix of a unicyclic bipartite graphBounds on the nullity, the H-rank and the Hermitian energy of a mixed graphOn the largest eigenvalue of a mixed graph with partial orientationBalancedness and the least Laplacian eigenvalue of some complex unit gain graphsRelation between the Hermitian energy of a mixed graph and the matching number of its underlying graphOn the N-spectrum of oriented graphsMaximizing the Order of a Regular Graph of Given Valency and Second EigenvalueThe negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrumMixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)Spectral fundamentals and characterizations of signed directed graphsHermitian energy and Hermitian Estrada index of digraphsThe relation between the H-rank of a mixed graph and the independence number of its underlying graphThe spectra of digraphs with Morita equivalent \(C^\ast\)-algebrasA new kind of Hermitian matrices for digraphsIntegral mixed circulant graphsThe \(k\)-generalized Hermitian adjacency matrices for mixed graphsMaximal digraphs whose Hermitian spectral radius is at most 2Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets

Uses Software




This page was built for publication: Large regular bipartite graphs with median eigenvalue 1