✦ LIBER ✦

Large sets of pseudosimilar vertices

✍ Scribed by Josef Lauri

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 174 KB
Volume: 155
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00379-b

No coin nor oath required. For personal study only.

✦ Synopsis

Perhaps the most interesting current problems in pseudosimilarity involve questions about graphs with large sets of pseudosimilar vertices or edges. We here look at some of the methods which have been employed to construct such graphs.

📜 SIMILAR VOLUMES

Intriguing Sets of Vertices of Regular G

Intriguing Sets of Vertices of Regular Graphs

✍ Bart De Bruyn; Hiroshi Suzuki 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 242 KB

Cycles through vertices of large maximum

Cycles through vertices of large maximum degree

✍ Bill Jackson 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 442 KB

## Abstract Let __G__ be a 2‐connected graph on __n__ vertices with maximum degree __k__ where __n__ ≤ 3__k__ ‐ 2. We show that there is a cycle in __G__ that contains all vertices of degree __k.__ © 1995 John Wiley & Sons, Inc.

Cycles containing many vertices of large

Cycles containing many vertices of large degree

✍ H.J. Veldman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Veldman, H.J., Cycles containing many vertices of large degree, Discrete Mathematics 101 (1992) 319-325. Let G be a 2-connected graph of order n, r a real number and V, = {u E V(G) ( d(v) 3 r}.

Maximal sets of triangle-factors on v =

Maximal sets of triangle-factors on v = 6m vertices

✍ Rolf S. Rees 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

We show that the necessary condition m ≤ k ≤ 3m -1 that there exists a maximal set of k triangle-factors on 6m ≥ 18 vertices is also sufficient, except possibly when k = m.

Large sets of coverings

✍ Tuvi Etzion 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 699 KB

Large sets of packings were investigated extensively. Much less is known about the dual problem, Le., large sets of coverings. We examine two types of important questions in this context; what is the maximum number of disjoint optimal coverings? and what is the minimum number of optimal coverings fo

Minimum Degree Conditions for Cycles Inc

Minimum Degree Conditions for Cycles Including Specified Sets of Vertices

✍ Wayne Goddard 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 404 KB