Delta invariant for Eulerian digraphs
From MaRDI portal
Publication:2079872
DOI10.1016/j.tcs.2022.06.016OpenAlexW4281718798MaRDI QIDQ2079872
Publication date: 7 October 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.06.016
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the difference of the domination number of a digraph and of its reverse
- Laplacian spectral characterization of some graph products
- Efficient computation of the characteristic polynomial of a threshold graph
- Algorithm on rainbow connection for maximal outerplanar graphs
- On a conjecture concerning spanning tree invariants and loop systems
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Which wheel graphs are determined by their Laplacian spectra?
- The minimal Laplacian spectral radius of trees with a given diameter
- On recognizing graph properties from adjacency matrices
- Enumeration of cospectral graphs.
- An iteration method for computing the total number of spanning trees and its applications in graph theory
- Upper bound for the trace norm of the Laplacian matrix of a digraph and normally regular digraphs
- Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs
- Graphs determined by polynomial invariants
- Maximum reachability preserved graph cut
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
- Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
- Enumeration of cospectral and coinvariant graphs
- Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs
- Laplacian energy of diameter 3 trees
- On the geodetic hull number of \(P_{k}\)-free graphs
- The algebraic connectivity of graphs with given circumference
- Isoperimetric numbers of graphs
- The sharpness of a lower bound on the algebraic connectivity for maximal graphs
- The Laplacian quadratic form and edge connectivity of a graph
- Spectrum of the 1-Laplacian and Cheeger's Constant on Graphs
- Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs
- On a bound on algebraic connectivity: the case of equality
- Local approximation of the maximum cut in regular graphs
This page was built for publication: Delta invariant for Eulerian digraphs
