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