Partial trees in weighted graphs-I
This paper generalizes the tree concept in Graph Theory, which plays a crucial role in many areas of science and technology. This paper also characterizes partial trees using the concept of maximum spanning trees.
Saved in:
Main Author: | Mathew,Sunil |
---|---|
Format: | Digital revista |
Language: | English |
Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2011
|
Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172011000200003 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Cycle connectivity in weighted graphs
by: Mathew,Sunil, et al.
Published: (2011) -
Ranking graph edges by the weight of their spanning arborescences or trees
by: Boaventura-Netto,Paulo Oswaldo
Published: (2008) -
On tree polynomials of graphs
by: West, Derek V.
Published: (2008-12-11T20:34:19Z) -
Enumeration of spanning trees in prisms of some graphs
by: Deen,Mohamed R. Zeen El
Published: (2023) -
Graph theory as I have known it /
by: Tutte, W.T. 61189
Published: (1998)