On a conjecture concerning spanning tree invariants and loop systems
From MaRDI portal
(Redirected from Publication:710878)
Recommendations
- Spanning tree invariants, loop systems and doubly stochastic matrices
- Spanning trees and a conjecture of Kontsevich
- On the number of spanning trees of circulant graphs
- Spanning trees on lattices and integral identities
- Spanning trees and Khovanov homology
- The homology of configuration spaces of trees with loops
- scientific article; zbMATH DE number 7132826
- On Torsor Structures on Spanning Trees
- Counting spanning trees in cobordism of two circulant graphs
- On the inertia set of a signed tree with loops
Cites work
Cited in
(83)- Distributed \(k\)-winners-take-all via multiple neural networks with inertia
- Invariants for weighted digraphs under one-sided state splittings
- On the weighted reverse cover cost of trees and unicyclic graphs with given diameter
- The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size
- Even order uniform hypergraph via the Einstein product
- On the first and second Zagreb indices of some products of signed graphs
- Characterizing signed mixed graphs with small eigenvalues
- Robust output consensus of discrete-time networked negative imaginary systems
- Representation of cyclotomic fields and their subfields
- Singular graphs and the reciprocal eigenvalue property
- Spectral analysis of three invariants associated to random walks on rounded networks with \(2n\)-pentagons
- Kemeny's constant for nonbacktracking random walks
- Resistance-distance betweenness: definition, properties, and application in complex linguistic networks
- On integer matrices with integer eigenvalues and Laplacian integral graphs
- Laplacian simplices
- Maximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition
- Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs
- A new matrix representation of multidigraphs
- A spectral method for bipartizing a network and detecting a large anti-community
- Joins of hypergraphs and their spectra
- Further results on the expected hitting time, the cover cost and the related invariants of graphs
- The resistance perturbation distance: a metric for the analysis of dynamic networks
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- On spectral radius of graphs with pendant paths
- Signed graphs with strong anti-reciprocal eigenvalue property
- Spanning trees and a conjecture of Kontsevich
- Hermitian adjacency matrix of the second kind for mixed graphs
- Robust load frequency control of nonlinear power networks
- On the topological matrix and topological indices
- Resistance distance and Kirchhoff index of the Q-vertex (or edge) join graphs
- On the spectral determinations of the connected multicone graphs \(K_r \nabla sK_t\)
- The spectral characterization of the connected multicone graphs \(K_w \nabla mK_{n,n}\)
- Adjacency eigenvalues of graphs without short odd cycles
- The spectral determination of the connected multicone graphs \(K_w \nabla rC_S\)
- On minors of the compound matrix of a Laplacian
- Relative Cayley graphs of finite groups
- A note on Bartholdi zeta function and graph invariants based on resistance distance
- Gram matrices of reproducing kernel Hilbert spaces over graphs
- Further results on resistance distance and Kirchhoff index in electric networks
- Spectra of generalized corona of graphs
- On the distance Laplacian spectra of graphs
- The spectra of a new join of graphs
- Moore-Penrose inverse of a Euclidean distance matrix
- Delta invariant for Eulerian digraphs
- Structural and spectral properties of corona graphs
- Synchronization of fractional-order colored dynamical networks via open-plus-closed-loop control
- On the adjacency matrix of a threshold graph
- Spanning tree invariants, loop systems and doubly stochastic matrices
- On the inertia set of a signed tree with loops
- Resistance distance and Kirchhoff index of \(R\)-vertex join and \(R\)-edge join of two graphs
- On resistance distance of Markov chain and its sum rules
- Graphs determined by signless Laplacian spectra
- scientific article; zbMATH DE number 1714671 (Why is no real title available?)
- Resistance distance and Kirchhoff index for a class of graphs
- On the second largest distance eigenvalue of a block graph
- Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
- On the spectrum of hypergraphs
- Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size
- Effective resistance is more than distance: Laplacians, simplices and the Schur complement
- Stochastic forms of non-negative matrices and Perron-regularity
- Standard monomials of 1-skeleton ideals of graphs and generalized signless Laplacians
- Squared distance matrices of trees with matrix weights
- Spectra of general hypergraphs
- On three new principles in non-equilibrium statistical mechanics and Markov semigroups of weak coupling limit type
- On a poset of trees revisited
- The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain
- Robust output consensus of networked negative imaginary systems via an integral quadratic constraint approach
- Output-based dynamic event-triggered consensus control for linear multiagent systems
- The inverse of the distance matrix of a distance well-defined graph
- Approximation of functions of large matrices with Kronecker structure
- On the Laplacian spectra of some variants of corona
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- Kirchhoff index and degree Kirchhoff index of complete multipartite graphs
- A reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\)
- On a quadratic programming problem involving distances in trees
- A grid function formulation of a class of ill-posed parabolic equations
- Kemeny's constant and Wiener index on trees
- Quantum discord of states arising from graphs
- Inverses of triangular matrices and bipartite graphs
- Spanning trees and even integer eigenvalues of graphs
- Robust cooperative control of multiple heterogeneous negative-imaginary systems
- Expected hitting times for random walks on the \(k\)-triangle graph and their applications
- Bicyclic graphs with extremal cover cost
This page was built for publication: On a conjecture concerning spanning tree invariants and loop systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710878)
