Publication date
March 1988
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractLet G be a simple (nondirected) graph with degree sequence d1, d2,…, dn. The number of spanning trees of G is bounded above by (nn−1)n−1Πdi∑di
AbstractLet G be a simple (nondirected) graph with degree sequence d1, d2,…, dn. The number of spanning trees of G is bounded above by (nn−1)n−1Πdi∑di
AbstractRecently, Levine [9] expressed the vertex weighted complexity on spanning trees (with a fixe...
Given a connected graph with edge costs, we seek a spanning tree having a specified degree at one ve...
This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and...
AbstractLet G be a simple (nondirected) graph with degree sequence d1, d2,…, dn. The number of spann...
Abstract. The number of splanning trees in a finite graph is first expressed as the derivative (at 1...
AbstractIn this paper, we derive new formulas for the number of spanning trees of a specific family ...
AbstractIn this paper, we present some sharp upper bounds for the number of spanning trees of a conn...
Let G be a simple, connected graph. The leaf number, L(G) of G, is dened as the maximum number of le...
We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by ...
summary:Let $\alpha (n)$ be the least number $k$ for which there exists a simple graph with $k$ vert...
International audienceWe describe a general purpose algorithm for counting simple cycles and simple ...
AbstractWe show that for positive integers n, m with n(n−1)/2≥m≥n−1, the graph Ln,m having n vertice...
AbstractFor a connected simple graph G let L(G) denote the maximum number of leaves in any spanning ...
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar ...
AbstractIt is shown that if G is a simple connected graph on n vertices, then perL(G)⩾ 2(n − 1)κ(G),...
AbstractRecently, Levine [9] expressed the vertex weighted complexity on spanning trees (with a fixe...
Given a connected graph with edge costs, we seek a spanning tree having a specified degree at one ve...
This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and...
AbstractLet G be a simple (nondirected) graph with degree sequence d1, d2,…, dn. The number of spann...
Abstract. The number of splanning trees in a finite graph is first expressed as the derivative (at 1...
AbstractIn this paper, we derive new formulas for the number of spanning trees of a specific family ...
AbstractIn this paper, we present some sharp upper bounds for the number of spanning trees of a conn...
Let G be a simple, connected graph. The leaf number, L(G) of G, is dened as the maximum number of le...
We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by ...
summary:Let $\alpha (n)$ be the least number $k$ for which there exists a simple graph with $k$ vert...
International audienceWe describe a general purpose algorithm for counting simple cycles and simple ...
AbstractWe show that for positive integers n, m with n(n−1)/2≥m≥n−1, the graph Ln,m having n vertice...
AbstractFor a connected simple graph G let L(G) denote the maximum number of leaves in any spanning ...
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar ...
AbstractIt is shown that if G is a simple connected graph on n vertices, then perL(G)⩾ 2(n − 1)κ(G),...
AbstractRecently, Levine [9] expressed the vertex weighted complexity on spanning trees (with a fixe...
Given a connected graph with edge costs, we seek a spanning tree having a specified degree at one ve...
This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and...
Add to ORKG