Inverses of trees
From MaRDI portal
Let \(G\) be a bipartite graph with non-singular adjacency matrix \(A\). For applications in Chemistry the least positive eigenvalue of \(A\) is of interest. The author proves a conjecture by I. Gutman that amongst all trees on \(2m\) vertices having perfect matchings, the path has smallest least positive eigenvalue. If \(G\) is a tree with a perfect matching it is shown that \(A^{-1}\) is diagonally similar to a \((0,1)\)-matrix. This result is used to obtain sharp bounds on the magnitude of the eigenvalue in question. A connection between the considered inversion problem and Möbius inversion on partially ordered sets is noted. The final section contains some open questions.
Recommendations
- scientific article; zbMATH DE number 125208
- Enumeration of trees by inversions
- On inverse problems for finite trees
- The inverse problem for certain tree parameters
- On the inverse and the dual index of a tree
- The inverse characteristic polynomial problem for trees
- Inversion of a recursive tree traversal
- Partially ordering the class of invertible trees
- Inverting non-invertible labeled trees
- Inverse sequences, rooted trees and their end spaces
Cites work
Cited in
(76)- Directed intervals and the dual of a graph
- Sharp lower bounds on the eigenvalues of trees
- Bounds on the second largest eigenvalue of a tree with perfect matchings
- Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching
- Bounds of eigenvalues of graphs
- Sharp bound of the kth eigenvalue of trees
- Inverses of bipartite graphs
- Acyclic molecules with greatest HOMO-LUMO separation
- Partially ordering the class of invertible trees
- On some graphs which satisfy reciprocal eigenvalue properties
- Distance spectrum, 1-factor and vertex-disjoint cycles
- A q-analogue of the bipartite distance matrix of a nonsingular tree
- On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching
- Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue
- Spectral radius and \([a,b]\)-factors in graphs
- Group inverses of adjacency matrices of cycles, wheels and brooms
- On the structure of the inverse of non-singular unicyclic graphs
- Classes of nonbipartite graphs with reciprocal eigenvalue property
- On unimodular tournaments
- On construction of upper and lower bounds for the HOMO-LUMO spectral gap
- On alternating paths and the smallest positive eigenvalue of trees
- The smallest positive eigenvalue of graphs under perturbation
- Inverses of weighted graphs
- On a construction of integrally invertible graphs and their spectral properties
- Self-inverse unicyclic graphs and strong reciprocal eigenvalue property
- Inverses of triangular matrices and bipartite graphs
- A short note on Layman permutations
- Upper bounds on the smallest positive eigenvalue of trees
- Strong reciprocal eigenvalue property of a class of weighted graphs
- Graph invertibility and median eigenvalues
- No Laplacian perfect state transfer in trees
- scientific article; zbMATH DE number 4087699 (Why is no real title available?)
- On reciprocal eigenvalue property of weighted trees
- On the inverse and the dual index of a tree
- Enumeration of trees by inversions
- Inverses of non-bipartite unicyclic graphs with a unique perfect matching
- Strongly self-inverse weighted graphs
- Inverting non-invertible labeled trees
- Almost self-inverse graphs
- Spectra of coronae
- On some graphs which possess inverses
- Unicyclic 3-colored digraphs with bicyclic inverses
- On the inverse of unicyclic 3-coloured digraphs
- The bipartite Laplacian matrix of a nonsingular tree
- On unicyclic non-bipartite graphs with tricyclic inverses
- On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching
- Combinatorial inversion in edge-weighted unicyclic graphs
- Group inverses of weighted trees
- Group inverses of a class of corona networks
- On the Moore-Penrose pseudo-inversion of block symmetric matrices and its application in the graph theory
- On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching II
- On non-bipartite graphs with strong reciprocal eigenvalue property
- Inverse of Hermitian adjacency matrix of mixed bipartite graphs
- Qualitative, statistical, and extreme properties of spectral indices of signable pseudo-invertible graphs
- On invertible non-bipartite unicyclic graphs with a unique perfect matching and their smallest positive eigenvalues
- \( \gamma \)-inverse graph of some mixed graphs
- Counterexamples to a conjecture on spectral determination of rooted product with a path
- Bicyclic inverses of bicyclic graphs with a unique perfect matching
- On sign-invertible graphs
- \(\mathfrak{C}\)-inverse of graphs and mixed graphs
- Bounds for the smallest positive eigenvalue of unicyclic graphs with diameter at most 4
- Bipartite unicyclic graphs with a unique perfect matching having the smallest positive eigenvalue equal to √2 − 1
- On the smallest positive eigenvalue of caterpillar unicyclic graphs
- Determinantal decomposition of graphs with a unique perfect matching
- Strongly self-dual graphs
- Minimizing the smallest positive eigenvalue over bipartite and bipartite bicyclic graphs with a unique perfect matching
- Towards a structural characterization of unimodular graphs with a unique perfect matching
- On generalized inverses of matrices associated with certain graph classes
- Combinatorial description of the inverse of the adjacency matrix of non-bipartite bicyclic graphs
- Eigenvalues and factors: a survey
- Null decomposition and a combinatorial-block generalized inversion of trees
- On graphs with generalized reciprocal eigenvalue property
- Graph invertibility
- On unimodular graphs
- Spectral radius of graphs with given matching number
- The inverse problem for certain tree parameters
This page was built for publication: Inverses of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1066161)
