The number of archiral trees.
The number of -matchings in almost every tree is a zero residue.
The number of isomorphism classes of spanning trees of a graph
The Number of Labeled Dissections of a k-Ball.
The number of labelled -arch graphs.
The number of spanning trees and chains of graphs.
The number of spanning trees of double graphs
The outer-distance of nodes in random trees.
The packing and covering of the complete graph. I: The forests of order five.
The path is the tree with smallest greatest Laplacian eigenvalue
The P-Laplacian spectral radius of weighted trees with a degree sequence and a weight set.
The realization of input-output maps using bialgebras.
The Reconstruction of a Connected Graph from its Spanning Trees
The relation between the number of leaves of a tree and its diameter
Let denote the minimum possible number of leaves in a tree of order and diameter Lesniak (1975) gave the lower bound for When is even, But when is odd, is smaller than in general. For example, while In this note, we determine using new ideas. We also consider the converse problem and determine the minimum possible diameter of a tree with given order and number of leaves.
The Rooted Tree Embedding Problem into Points in the Plane.
The signless Laplacian spectral radius of bicyclic graphs with a given girth.
The spectral method for detrmining the number of trees.
The spectrum of the edge corona of two graphs.
The star is the tree with greatest greatest Laplacian eigenvalue
The Steiner Minimal Network for Convex Configurations.