The permanent of the Laplacian matrix of a bipartite graph
Antonín Vrba (1986)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “The Laplacian permanental polynomial for trees”
The permanent of the Laplacian matrix of a bipartite graph
Decomposition of complete graphs into trees
Gary Haggard, Peter McWha (1975)
Czechoslovak Mathematical Journal
Similarity:
Determinantal generating functions of colored spanning forests.
Constantine, Gregory M., Buliga, Marius G. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Relaxed graceful labellings of trees.
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Weak Saturation Numbers for Sparse Graphs
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson (2013)
Discussiones Mathematicae Graph Theory
Similarity:
For a fixed graph F, a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G, there is a copy of F in G + e. The minimum number of edges in an F-saturated graph of order n will be denoted by sat(n, F). A graph G is weakly F-saturated if there is an ordering of the missing edges of G so that if they are added one at a time, each edge added creates a new copy of F. The minimum size of a weakly F-saturated graph G of order n will be denoted by wsat(n, F). The graphs...