✦ LIBER ✦

Graphs cospectral with starlike trees

✍ Scribed by N. Ghareghani; F. Ramezani; B. Tayfeh-Rezaie

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 169 KB
Volume: 429
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.01.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some results on starlike trees and sunli

Some results on starlike trees and sunlike graphs

✍ Mirko Lepović 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 216 KB

Coined quantum walks lift the cospectral

Coined quantum walks lift the cospectrality of graphs and trees

✍ David Emms; Simone Severini; Richard C. Wilson; Edwin R. Hancock 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 520 KB

Trees and unicyclic graphs with hamilton

Trees and unicyclic graphs with hamiltonian path graphs

✍ Xingxing Yu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract We prove two conjectures of Broersma and Hoede about path graphs of trees and unicyclic graphs.

Graphs with all spanning trees nonisomor

Graphs with all spanning trees nonisomorphic

✍ Lars Døvling Andersen; Preben Dahl Vestergaard 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 487 KB

The paper presents some results on graphs that do not have two distinct isomorphic spanning trees. It is proved that any such connected graph with at least two vertices must have the property that each end-block has just one edge. On the other hand, the class of such graphs is quite large; it is sho

Graphs with homeomorphically irreducible

Graphs with homeomorphically irreducible spanning trees

✍ Michael O. Albertson; David M. Berman; Joan P. Hutchinson; Carsten Thomassen 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 509 KB

## Abstract It is an NP‐complete problem to decide whether a graph contains a spanning tree with no vertex of degree 2. We show that these homeomorphically irreducible spanning trees are contained in all graphs with minimum degree at least __c__√__n__ and in triangulations of the plane. They are ne

Packing and Decomposition of Graphs with

Packing and Decomposition of Graphs with Trees

✍ Raphael Yuster 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Let H be a tree on h 2 vertices. It is shown that if n is sufficiently large and G=(V, E ) is an n-vertex graph with $(G) wnÂ2x , then there are w |E |Â(h&1)x edge-disjoint subgraphs of G which are isomorphic to H. In particular, if h&1 divides |E | then there is an H-decomposition of G. This result