Name
Abstract | ||
|---|---|---|
Let G be a graph on n vertices, delta and alpha be the minimum degree and independmice number of G, respectively. We prove that if G is a 2-connected graph and vertical bar N(x)boolean OR N(y)vertical bar >= n-delta-1 for each pair of nonadjacent vertices x, y with 1 <= vertical bar N(x)boolean AND N(y)vertical bar <= alpha - 1, then G is hamiltonian or G is an element of {G(1), G(2)} (see Figure 1.1 and Figure 1.2). As a corollary, if G is a 2-connected graph and vertical bar N(x)boolean OR N(y)vertical bar >= n - delta for each pair of nonadjacent vertices y with 1 <= vertical bar N(x) boolean AND N(y)vertical bar <= alpha - 1, then G is hamiltonian. This result extends former results by Faudree et al ([5]) and Yin ([7]). |
Year | DOI | Venue |
|---|---|---|
2012 | null | ARS COMBINATORIA |
Keywords | Field | DocType |
hamiltonian,neighborhood unions,neighborhood intersection,an essential independent set | Discrete mathematics,Graph,Independence number,Combinatorics,Vertex (geometry),Hamiltonian (quantum mechanics),Hamiltonian path problem,Mathematics | Journal |
Volume | Issue | ISSN |
105 | null | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kewen Zhao | 1 | 4 | 2.56 |
| Lili Zhang | 2 | 1 | 1.38 |
| Hong-Jian Lai | 3 | 631 | 97.39 |
| Yehong Shao | 4 | 102 | 14.70 |