Hamiltonian graphs involving neighborhood intersections
نویسندگان
چکیده
منابع مشابه
Hamiltonian graphs involving neighborhood conditions
Let G be a graph on n vertices, δ and α be the minimum degree and independence number of G, respectively. In this paper we prove that if G is a 2-connected graph and |N(x) ∪ N(y)| ≥ n − δ − 1 for each pair of nonadjacent vertices x, y with 1 ≤ |N(x) ∩ N(y)| ≤ α − 1, then G is hamiltonian or G ∈ {Gn−1 2 ,Kn+1 2 ,K∗ 2 ∨ 3Kn−2 3 } where K∗ 2 and Gn−1 2 are subgraphs on 2 and n−1 2 vertices respect...
متن کاملNeighborhood unions and hamiltonian properties in graphs
We investigate the relationship between the cardinality of the union of the neighborhoods of an arbitrary pair of nonadjacent vertices and various hamiltonian type properties in graphs. In particular, we show that if G is 2-connected, of order p 2 3 and if for every pair of nonadjacent vertices x and y: (a) IN(x) u N( y)l 2 (p 1)/2, then G is traceable, (b) IN(x) u N( y)l 2 (2p 1)/3, then G is ...
متن کاملHamiltonian Connected Graphs Involving Forbidden Subgraphs
We consider the pair of graphs S and T such that every 3-connected {S, T}-free graph is hamiltonian connected. Such pairs are called hamiltonian connected pairs. We show three new hamiltonian connected pairs. Combing our results and a result of Shepherd, we conclude that if {S, T} is a pair of graphs such that every 2-connected {S, T}-free graph is hamiltonian then every 3-connected {S, T}-free...
متن کاملNeighborhood intersections and Hamiltonicity in almost claw-free graphs
Abstract: Let G be a graph. The partially squared graph G∗ of G is a graph obtained from G by adding edges uv satisfying the conditions uv 6∈ E(G), and there is some w ∈ N(u) ∩ N(v), such that N(w) ⊆ N(u) ∪ N(v) ∪ {u, v}. Let t > 1 be an integer and Y ⊆ V (G), denote n(Y ) = |{v ∈ V (G) | min y∈Y {distG(v, y)} ≤ 2}|, It(G) = {Z |Z is an independent set of G, |Z| = t}. In this paper, we show tha...
متن کاملHamiltonian properties of graphs with large neighborhood unions
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 N(v)l: d(u, v)=2}. O.~ proved that G is hamiltonian if o2~>n ~>3, while Faudree et al. proved t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90238-o