In this letter, we only consider simple graphs. Suppose that G is a graph with n vertices. If G contains a cycle of length n, then we say that G is Hamiltonian. If G contains a cycle of length k for each k, 3 ≤k≤n, ...In this letter, we only consider simple graphs. Suppose that G is a graph with n vertices. If G contains a cycle of length n, then we say that G is Hamiltonian. If G contains a cycle of length k for each k, 3 ≤k≤n, then G is pancyclic. We say that G is a vertex-k-cycle graph if G contains a cycle展开更多
In this note, we denote by G a graph with order n, by V and E the vertex set andedge set of G, respectively. V<sub>0</sub>={v∈V|d（v）≥n/2}, V<sub>0</sub>=V\V<sub>0</sub>. Let H b...In this note, we denote by G a graph with order n, by V and E the vertex set andedge set of G, respectively. V<sub>0</sub>={v∈V|d（v）≥n/2}, V<sub>0</sub>=V\V<sub>0</sub>. Let H be a subgraph ofG. For simplicity, we also use H to denote the vertex set of it. For a∈V S, TV,展开更多
文摘In this letter, we only consider simple graphs. Suppose that G is a graph with n vertices. If G contains a cycle of length n, then we say that G is Hamiltonian. If G contains a cycle of length k for each k, 3 ≤k≤n, then G is pancyclic. We say that G is a vertex-k-cycle graph if G contains a cycle
文摘In this note, we denote by G a graph with order n, by V and E the vertex set andedge set of G, respectively. V<sub>0</sub>={v∈V|d（v）≥n/2}, V<sub>0</sub>=V\V<sub>0</sub>. Let H be a subgraph ofG. For simplicity, we also use H to denote the vertex set of it. For a∈V S, TV,
