On a conjecture concerning spanning tree invariants and loop systems

DOI10.1016/J.LAA.2010.06.010zbMATH Open1215.05028OpenAlexW2015740551WikidataQ123301631 ScholiaQ123301631MaRDI QIDQ710878FDOQ710878

Authors: R. B. Bapat 

Publication date: 22 October 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.06.010

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

zbMATH Keywords

Markov chainsLaplacian matrixdoubly stochastic matricesloop systems

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05)

Cites Work

• Combinatorial matrix theory
• Spanning tree invariants, loop systems and doubly stochastic matrices
• On mean recurrence times of Markov chains and spanning tree invariants

Cited In (83)

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

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)