Some results on graph parameters in weighted graphs
β Scribed by Peter Dankelmann; Dieter Rautenbach; Lutz Volkmann
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 295 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A variety of recent developments in hamiltonian theory are reviewed. In particular, several sufficient conditions for a graph to be hamiltonian, certain hamiltonian properties of line graphs, and various hamiltonian properties of powers of graphs are discussed. Furthermore, the concept
Shee, S.-C., Some results on I-valuation of graphs involving complete bipartite graphs, Discrete Mathematics 87 (1991) 73-80. In this paper we show that a graph G obtained from a complete bipartite graph K,,, and a collection of q (cmax{m, n}) stars G, by joining the centre of G, to every vertex of
## Abstract We investigate tree decompositions (__T__,(__X__~t~)~tΟ΅V(T)~) whose width is βclose to optimalβ and such that all the subtrees of __T__ induced by the vertices of the graph are βsmall.β We prove the existence of such decompositions for various interpretations of βclose to optimalβ and β