✦ LIBER ✦

On the Panconnectivity of Graphs with Large Degrees and Neighborhood Unions

✍ Scribed by B. Wei; Y. Zhu

Publisher: Springer Japan
Year: 1998
Tongue: English
Weight: 858 KB
Volume: 14
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730050030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long cycles in graphs with large degree

Long cycles in graphs with large degree sums and neighborhood unions

✍ Van den Heuvel, J. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 801 KB

We present and prove several results concerning the length of longest cycles in 2connected or I-tough graphs with large degree sums. These results improve many known results on long cycles in these graphs. We also consider the sharpness of the results and discuss some possible strengthenings.

Hamiltonian properties of graphs with la

Hamiltonian properties of graphs with large neighborhood unions

✍ Douglas Bauer; Genghua Fan; Henk Jan Veldman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 768 KB

Bauer, D., G. Fan and H.J. Veldman, Hamiltonian properties of graphs with large neighborhood unions, Discrete Mathematics 96 (1991) 33-49. Let G be a graph of order n, a k =min{~ki=ld(vi): {V 1 ..... Vn} is an independent set of vertices in G}, NC=min{IN(u) 13N(v)l:uv~E(G)} and NC2=min{IN(u) t3 wh

Pan-connectedness of graphs with large n

Pan-connectedness of graphs with large neighborhood unions

✍ Kewen Zhao 📂 Article 📅 2008 🏛 Springer Vienna 🌐 English ⚖ 450 KB

Long dominating cycles and paths in grap

Long dominating cycles and paths in graphs with large neighborhood unions

✍ H. J. Broersma; H. J. Veldman 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB 👁 1 views

## Abstract Let __G__ be a graph of order __n__ and define __NC(G)__ = min{|__N__(__u__) ∪ __N__(__v__)| |__uv__ ∉ __E__(__G__)}. A cycle __C__ of __G__ is called a __dominating cycle__ or __D__‐__cycle__ if __V__(__G__) ‐ __V__(__C__) is an independent set. A __D__‐__path__ is defined analogously.

A proof of a conjecture about Dλ-paths i

A proof of a conjecture about Dλ-paths in graphs with large neighborhood unions

✍ Jianping Li; Feng Tian 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 570 KB

Neighborhood unions and the cycle cover

Neighborhood unions and the cycle cover number of a graph

✍ Guantao Chen; Ronald J. Gould; Michael S. Jacobson; Richard H. Schelp 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

## Abstract For several years, the study of neighborhood unions of graphs has given rise to important structural consequences of graphs. In particular, neighborhood conditions that give rise to hamiltonian cycles have been considered in depth. In this paper we generalize these approaches to give a