Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
DOI10.1006/EUJC.1995.0077zbMATH Open0873.05065OpenAlexW1994508421MaRDI QIDQ5961460FDOQ5961460
Publication date: 20 October 1997
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1995.0077
Recommendations
- Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs
- On the Laplacian coefficients of graphs under some transformations
- Spanning tree enumeration and nearly triangular graph Laplacians
- Adjacency polynomials of digraph transformations
- Transforming spanning trees and pseudo-triangulations
- scientific article; zbMATH DE number 3966096
- Transforming spanning trees: A lower bound
- Laplacian matrices and spanning trees of tree graphs
- The Laplacian polynomial of complete multipartite graphs
- On polynomials of spanning trees
Laplacian matrixextremal problemscharacteristic polynomialgraph transformationsnumber of spanning trees
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Enumeration in graph theory (05C30)
Cited In (16)
- Detection of core–periphery structure in networks using spectral methods and geodesic paths
- Nonisomorphic trees with the same T-polynomial
- Laplacian spectra of digraph transformations
- Spectra of digraph transformations
- Comparison of graphs by their number of spanning trees
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- Title not available (Why is that?)
- A certain polynomial of a graph and graphs with an extremal number of trees
- Tree counting polynomials for labelled graphs. I: Properties
- Laplacian spectra and spanning trees of threshold graphs
- Solutions of some further graph equations
- Schur convex functions on the spectra of graphs
- On the distribution of eigenvalues of graphs
- Tracking network dynamics: a survey using graph distances
- On the Laplacian coefficients of graphs under some transformations
- Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications
This page was built for publication: Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961460)
