𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the minimal length of the longest trail in a fixed edge-density graph

✍ Scribed by Szécsi, Vajk

Book ID
120839974
Publisher
Walter de Gruyter GmbH
Year
2013
Tongue
English
Weight
789 KB
Volume
11
Category
Article
ISSN
2391-5455

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the length of longest dominating cycl
On the length of longest dominating cycles in graphs
✍ Hoa Vu Dinh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 719 KB

Vu Dinh, H., On the length of longest dominating cycles in graphs, Discrete Mathematics 121 (1993) 21 l-222. ## A cycle C in an undirected and simple graph if G contains a dominating cycle. There exists l-tough graph in which no longest cycle is dominating. Moreover, the difference of the length

The Length of the Shortest Edge of a Gra
The Length of the Shortest Edge of a Graph on a Sphere
✍ Hiroshi Maehara 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 62 KB

Let S d denote a unit sphere in the (d + 1)-dimensional Euclidean space R d+1 (d ≥ 1). For a simple graph G E with edge set E, take independent random points x k , k ∈ V (G E ), on S d , and let D E be the minimum value of the spherical distance between x i , x j for {i, j} ∈ E. We prove that , whe

The maximum number of edges in a graph w
The maximum number of edges in a graph with fixed edge-degree
✍ R.J. Faudree; J. Sheehan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.

The maximum number of edges in a minimal
The maximum number of edges in a minimal graph of diameter 2
✍ Zoltán Füredi 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 717 KB

## Abstract A graph __g__ of diameter 2 is minimal if the deletion of any edge increases its diameter. Here the following conjecture of Murty and Simon is proved for __n__ < __n__~o~. If __g__ has __n__ vertices then it has at most __n__^2^/4 edges. The only extremum is the complete bipartite graph