The Minimal Trees of Steiner Wiener Index With Given Matching Number

Pure Mathematics
doi 10.12677/pm.2017.73025
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Hans Publishers

Related search

Steiner Wiener Index and Graph Parameters

Advances in Applied Mathematics
2016English

The Number of Subtrees of Trees With Given Diameter

Discrete Mathematics, Algorithms and Applications
CombinatoricsDiscrete Mathematics
2018English

Steiner Minimal Trees on Sets of Four Points

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1987English

The Gutman Index and the Edge-Wiener Index of Graphs With Given Vertex-Connectivity

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2016English

Spectral Radius of Graphs With Given Matching Number

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2007English

On the Matching Number of Directed Triangle Trees

Computer Science and Application
2016English

Extremal Laplacian-Energy-Like Invariant of Graphs With Given Matching Number

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2013English

The Number of Spanning Trees in Graphs With a Given Degree Sequence

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
1995English

Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1969English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy