✦ LIBER ✦

Trees with maximum p-reinforcement number

✍ Scribed by Lu, You; Xu, Jun-Ming

Book ID: 124144343
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 407 KB
Volume: 175
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.05.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs with the maximum number of spa

On graphs with the maximum number of spanning trees

✍ Alexander K. Kelmans 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

Let 3:; denote the set of simple graphs with n vertices and m edges, t ( G ) the number of spanning trees of a graph G , and F 2 H if t(K,\E(F))?t(K,\E(H)) for every s? max{u(F), u ( H ) } . We give a complete characterization of >-maximal (maximum) graphs in 3:; subject to m 5 n . This result conta

Finding the Graph with the Maximum Numbe

Finding the Graph with the Maximum Number of Spanning Trees

✍ George Moustakides; Samuel D. Bedrosian 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 328 KB

The problem is to determine the linear graph that has the maximum number of spanning trees, where only the number of nodes N and the number of branches B are prescribed. We deal with connected graphs G(N, B) obtained by deleting D branches from a complete graph KN. Our solution is for D less than or

The structure and maximum number of maxi

The structure and maximum number of maximum independent sets in trees

✍ Jennifer Zito 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 732 KB

A subset of vertices is a maximum independent set if no two of the vertices are joined by an edge and the subset has maximum cardinality. In this paper we answer a question posed by Herb Wilf. We show that the greatest number of maximum independent sets for a tree of n vertices is 2(n-3\* for odd n

On the characterization of graphs with m

On the characterization of graphs with maximum number of spanning trees

✍ L. Petingi; F. Boesch; C. Suffel 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 591 KB

A graph G with n nodes and e edges is said to be t-optimal if G has the maximum number of spanning trees among all graphs with the same number of nodes and edges as G. Hitherto, t-optimal graphs have been characterized for the following cases: (a) n=sp, and e=(s(s-1)/2)p 2, when s and p are positive

Largest Number of Subtrees of Trees with

Largest Number of Subtrees of Trees with a Given Maximum Degree

✍ Kirk, Russell; Wang, Hua 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 190 KB

Trees with maximum nullity

✍ Stanley Fiorini; Ivan Gutman; Irene Sciriha 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 199 KB