✦ LIBER ✦

Matchings in starlike trees

✍ Scribed by I. Gutman; O. Araujo; J. Rada

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 250 KB
Volume: 14
Category: Article
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(01)00054-4

No coin nor oath required. For personal study only.

✦ Synopsis

Let

m(G,k)

be the number of k-matchings in the graph G. We write G1 -~ G2 if m(Gl,k) <_ m(G2,k) for all k = 1,2,.... A tree is said to be starlike if it possesses exactly one vertex of degree greater than two. The relation T1 -~ T2 is shown to hold for various pairs of starlike trees T1,T2. The starlike trees (with a given number of vertices), extremal with respect to the relation _, are characterized.

📜 SIMILAR VOLUMES

Graphs cospectral with starlike trees

✍ N. Ghareghani; F. Ramezani; B. Tayfeh-Rezaie 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Parallel computation of matchings in tre

Parallel computation of matchings in trees

✍ Constantine N.K. Osiakwan; Selim G. Akl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 932 KB

We present adaptive parallel algorithms for b-matchings in trees. The algorithms are designed using the exclusive-read exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a tree of n vertices, we present an algorithm that determines a maximum cardinality b-m

Matchings in random superpositions of bi

Matchings in random superpositions of bipartite trees

✍ E.M. Palmer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 540 KB

The starlike trees which span a hypercub

The starlike trees which span a hypercube

✍ Frank Harary; Martin Lewinter 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 222 KB

A connected bipartite graph is called equitable if it has the same number of nodes in each of its two colors. A starlike tree with b branches is a subdivision of the star K~. b with b ~> 3. We prove that a starlike tree T with b branches, where 3 ~< b ~< n, having 2 n nodes spans the hypercube Qn if

Some results on symmetric double starlik

Some results on symmetric double starlike trees

✍ Mirjana Lazić 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 188 KB

Starlike trees are determined by their L

Starlike trees are determined by their Laplacian spectrum

✍ G.R. Omidi; K. Tajbakhsh 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 103 KB

In this paper, we show that if G is a starlike tree, then it is determined by its Laplacian spectrum. Moreover we prove some facts about trees with the same adjacency spectrum as a starlike tree.