The number of trees in a graph. I. II
From MaRDI portal
Publication:2524373
zbMath0146.45902MaRDI QIDQ2524373
Publication date: 1966
Published in: Automation and Remote Control (Search for Journal in Brave)
Related Items
Laplacian spectra of power graphs of certain prime-power Abelian groups, Weighted complexities of graph products and bundles, Detection of core–periphery structure in networks using spectral methods and geodesic paths, On the spectral characterization of some unicyclic graphs, On the Jacobian group of a cone over a circulant graph, Bell Graphs are Determined by their Laplacian Spectra, Distance eigenvalues of a cograph and their multiplicities, The multi-fan graphs are determined by their Laplacian spectra, Generalizations of Abel's and Hurwitz's identities, Eigenvalue location in cographs, Laplacian spectral determination of path-friendship graphs, On the spectra of nonsymmetric Laplacian matrices, Spectra of generalized compositions of graphs and hierarchical networks, Which wheel graphs are determined by their Laplacian spectra?, Cographs: eigenvalues and Dilworth number, On generic forms of complementary graphs, Forest matrices around the Laplacian matrix, The limit points of Laplacian spectra of graphs
