Publication:5676231
From MaRDI portal
zbMath0261.05102MaRDI QIDQ5676231
Publication date: 1973
05C05: Trees
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05C30: Enumeration in graph theory
Related Items
Unnamed Item, Almost all trees are co-immanantal, Counting and coding identity trees with fixed diameter and bounded degree, Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\), A study of graph spectra for comparing graphs and trees, On a Laplacian spectral characterization of graphs of index less than 2, Clique-inserted-graphs and spectral dynamics of clique-inserting, On the asymptotic behavior of graphs determined by their generalized spectra, Branching in graphs and molecules, Constructing trees with given eigenvalues and angles, Permanental polynomials of graphs, The symbiotic relationship of combinatorics and matrix theory, The distribution of degrees in a large random tree, An introduction to matching polynomials, Spectra of Cayley graphs, A linear algorithm for disjoint matchings in trees, Distance matrix polynomials of trees, On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs, Construction of graphs with special properties, Laplacian matrices of graphs: A survey, Which graphs are determined by their spectrum?, Reconstruction of weighted graphs by their spectrum, Research problems from the 19th British Combinatorial Conference, Extremal f-trees and embedding spaces for molecular graphs, Graphs determined by polynomial invariants, Laplacian spectra and spanning trees of threshold graphs, The enumeration of trees with and without given limbs, Coined quantum walks lift the cospectrality of graphs and trees, On the spectral characterization of T-shape trees, A sufficient condition for a family of graphs being determined by their generalized spectra, On the Characteristic Equations of the Characteristic Polynomial
