✦ LIBER ✦

Pan-connectedness of graphs with large neighborhood unions

✍ Scribed by Kewen Zhao

Publisher: Springer Vienna
Year: 2008
Tongue: English
Weight: 450 KB
Volume: 156
Category: Article
ISSN: 0026-9255
DOI: 10.1007/s00605-008-0013-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the Panconnectivity of Graphs with La

On the Panconnectivity of Graphs with Large Degrees and Neighborhood Unions

✍ B. Wei; Y. Zhu 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 858 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.

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.

Neighborhood unions and hamiltonicity of

Neighborhood unions and hamiltonicity of graphs

✍ Ruqun Shen; Feng Tian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Let G be a graph of order n. In this paper, we prove that if G is a 2-connected graph of order n such that for all u, ve V(G), 2 where dist(u,v) is the distance between u and v in G, then either G is hamiltonian, or G is a spanning subgraph of a graph in one of three families of exceptional graphs.

A sufficient condition for graphs with l

A sufficient condition for graphs with large neighborhood unions to be traceable

✍ Shijun Ren 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 246 KB

We prove that a 2-connected graph G of order p is traceable if (u, v, w, x are distinct vertices of G). In addition, we give a short proof of Lindquester's conjecture.