On a conjecture concerning spanning tree invariants and loop systems

From MaRDI portal
Publication:710878

DOI10.1016/j.laa.2010.06.010zbMath1215.05028OpenAlexW2015740551WikidataQ123301631 ScholiaQ123301631MaRDI QIDQ710878

Ravindra 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




Related Items (74)

Further results on the expected hitting time, the cover cost and the related invariants of graphsSynchronization of fractional-order colored dynamical networks via open-plus-closed-loop controlInvariants for weighted digraphs under one-sided state splittingsSpectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagonsOn three new principles in non-equilibrium statistical mechanics and Markov semigroups of weak coupling limit typeStochastic forms of non-negative matrices and Perron-regularityOn the Laplacian spectra of some variants of coronaOn a quadratic programming problem involving distances in treesRepresentation of cyclotomic fields and their subfieldsOn the second largest distance eigenvalue of a block graphKirchhoff index and degree Kirchhoff index of complete multipartite graphsThe maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given sizeOn resistance distance of Markov chain and its sum rulesOn spectral radius of graphs with pendant pathsKemeny's constant for nonbacktracking random walksOn the distance Laplacian spectra of graphsOn integer matrices with integer eigenvalues and Laplacian integral graphsExtensions on spectral extrema of \(C_5/C_6\)-free graphs with given sizeEven order uniform hypergraph via the Einstein productSquared distance matrices of trees with matrix weightsOn the first and second Zagreb indices of some products of signed graphsA note on Bartholdi zeta function and graph invariants based on resistance distanceResistance-distance betweenness: definition, properties, and application in complex linguistic networksThe resistance perturbation distance: a metric for the analysis of dynamic networksRobust output consensus of networked negative imaginary systems via an integral quadratic constraint approachRobust cooperative control of multiple heterogeneous negative-imaginary systemsJoins of hypergraphs and their spectraSigned graphs with strong anti-reciprocal eigenvalue propertyKemeny's constant and Wiener index on treesCharacterizing signed mixed graphs with small eigenvaluesQuantum discord of states arising from graphsSpectra of generalized corona of graphsOn the adjacency matrix of a threshold graphOn minors of the compound matrix of a LaplacianSpanning trees and even integer eigenvalues of graphsGram matrices of reproducing kernel Hilbert spaces over graphsA grid function formulation of a class of ill-posed parabolic equationsResistance distance and Kirchhoff index for a class of graphsA reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\)Further results on resistance distance and Kirchhoff index in electric networksInverses of triangular matrices and bipartite graphsOn the spectrum of hypergraphsAdjacency eigenvalues of graphs without short odd cyclesThe inverse of the distance matrix of a distance well-defined graphSpectra of general hypergraphsApproximation of functions of large matrices with Kronecker structureGraphs determined by signless Laplacian spectraOn the spectral determinations of the connected multicone graphsOn the topological matrix and topological indicesA new matrix representation of multidigraphsThe spectral characterization of the connected multicone graphsThe spectra of a new join of graphsBicyclic graphs with extremal cover costA spectral method for bipartizing a network and detecting a large anti-communityResistance distance in subdivision-vertex join and subdivision-edge join of graphsThe spectral determination of the connected multicone graphsExact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization ProblemsMoore-Penrose inverse of a Euclidean distance matrixOn a poset of trees revisitedResistance distance and Kirchhoff index of the Q-vertex (or edge) join graphsRobust load frequency control of nonlinear power networksLaplacian simplicesThe Kirchhoff index and spanning trees of Möbius/cylinder octagonal chainOutput-based dynamic event-triggered consensus control for linear multiagent systemsStandard monomials of 1-skeleton ideals of graphs and generalized signless LaplaciansEffective resistance is more than distance: Laplacians, simplices and the Schur complementDelta invariant for Eulerian digraphsRelative Cayley graphs of finite groupsExpected hitting times for random walks on the \(k\)-triangle graph and their applicationsMaximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary conditionThe \(k\)-generalized Hermitian adjacency matrices for mixed graphsResistance distance and Kirchhoff index of \(R\)-vertex join and \(R\)-edge join of two graphsHermitian adjacency matrix of the second kind for mixed graphsStructural and spectral properties of corona graphs



Cites Work


This page was built for publication: On a conjecture concerning spanning tree invariants and loop systems