Inverses of trees

From MaRDI portal
Revision as of 23:41, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1066161

DOI10.1007/BF02579440zbMath0578.05049OpenAlexW2017538877MaRDI QIDQ1066161

Chris D. Godsil

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579440




Related Items (51)

Inverses of non-bipartite unicyclic graphs with a unique perfect matchingOn the inverse of unicyclic 3-coloured digraphsSpectral radius and \([a,b\)-factors in graphs] ⋮ No Laplacian Perfect State Transfer in TreesUnnamed ItemStrong reciprocal eigenvalue property of a class of weighted graphsGroup inverses of adjacency matrices of cycles, wheels and broomsGraph invertibility and median eigenvaluesOn unimodular graphsSpectral radius of graphs with given matching numberInverses of weighted graphsOn a construction of integrally invertible graphs and their spectral propertiesSelf-inverse unicyclic graphs and strong reciprocal eigenvalue propertyOn the structure of the inverse of non-singular unicyclic graphsSharp lower bounds on the eigenvalues of treesBounds on the second largest eigenvalue of a tree with perfect matchingsOn reciprocal eigenvalue property of weighted treesThe bipartite Laplacian matrix of a nonsingular treeOn unicyclic non-bipartite graphs with tricyclic inversesUnnamed ItemOn the smallest positive eigenvalue of bipartite graphs with a unique perfect matchingCombinatorial inversion in edge-weighted unicyclic graphsA short note on Layman permutationsGroup inverses of weighted treesGroup inverses of a class of corona networksOn the Moore-Penrose pseudo-inversion of block symmetric matrices and its application in the graph theoryUpper bounds on the smallest positive eigenvalue of treesAcyclic molecules with greatest HOMO-LUMO separationInverses of triangular matrices and bipartite graphsClasses of nonbipartite graphs with reciprocal eigenvalue propertyOn unimodular tournamentsOn some graphs which possess inversesPartially ordering the class of invertible treesSpectra of coronaeOn some graphs which satisfy reciprocal eigenvalue propertiesOn construction of upper and lower bounds for the HOMO-LUMO spectral gapStrongly self-dual graphsUnnamed ItemOn alternating paths and the smallest positive eigenvalue of treesGraph invertibilitySolution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matchingOn the inverse and the dual index of a treeThe smallest positive eigenvalue of graphs under perturbationDirected intervals and the dual of a graphAlmost self-inverse graphsDistance spectrum, 1-factor and vertex-disjoint cyclesA \(q\)-analogue of the bipartite distance matrix of a nonsingular treeOn the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matchingBounds of eigenvalues of graphsUpper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalueSharp bound of the \(k\)th eigenvalue of trees




Cites Work




This page was built for publication: Inverses of trees